|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14493 occurrences of 5604 keywords
|
|
|
Results
Found 24722 publication records. Showing 24719 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
45 | Alexandre Renaux, Philippe Forster, Pascal Larzabal, Christ D. Richmond, Arye Nehorai |
A Fresh Look at the Bayesian Bounds of the Weiss-Weinstein Family. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(11), pp. 5334-5352, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
45 | Jun Wu 0010, Tei-Wei Kuo |
Real-Time Scheduling of CPU-Bound and I/O-Bound Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 6th International Workshop on Real-Time Computing and Applications Symposium (RTCSA '99), 13-16 December 1999, Hong Kong, China, pp. 303-, 1999, IEEE Computer Society, 0-7695-0306-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
CPU-Bound Process, I/O-Bound Process, Real-Time Systems, Real-Time Scheduling, Priority Ceiling Protocol |
42 | Satoshi Fujita, Masayuki Masukawa, Shigeaki Tagashira |
A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 9th International Conference on Parallel and Distributed Systems, ICPADS 2002, Taiwan, ROC, December 17-20, 2002, pp. 611-616, 2002, IEEE Computer Society, 0-7695-1760-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
lower bound on the execution time, quadratic algorithm, Branch-and-bound algorithm, multiprocessor scheduling problem |
41 | Yufeng Wu, Dan Gusfield |
A new recombination lower bound and the minimum perfect phylogenetic forest problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(3), pp. 229-247, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Lower bound on the minimum number of recombination, Ancestral recombination graph, Computational complexity, Recombination, Population genetics |
40 | Xijin Yan, Jun Yang, Zhen Zhang 0010 |
An outer bound for multisource multisink network coding with minimum cost consideration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2373-2385, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
K-pairs transmission, max-flow min-cut bound, multisource multisink network, network sharing bound, three-layer network, network coding, side information |
38 | Juliana Tay, Yang Miang Goh, Sufiana Safiena, Helen Bound |
Designing digital game-based learning for professional upskilling: A systematic literature review. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Educ. ![In: Comput. Educ. 184, pp. 104518, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Jim Bound, Yanick Pouffary, Steve Klynsma, Tim Chown, David Green |
IPv6 Enterprise Network Analysis - IP Layer 3 Focus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RFC ![In: RFC 4852, pp. 1-32, April 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Jim Bound |
IPv6 Enterprise Network Scenarios. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RFC ![In: RFC 4057, pp. 1-17, June 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Robert E. Gilligan, Susan Thomson 0002, Jim Bound, Jack McCann, W. Richard Stevens |
Basic Socket Interface Extensions for IPv6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RFC ![In: RFC 3493, pp. 1-39, February 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
38 | Ralph E. Droms, Jim Bound, Bernie Volz, Ted Lemon, Charles E. Perkins, Mike Carney |
Dynamic Host Configuration Protocol for IPv6 (DHCPv6). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RFC ![In: RFC 3315, pp. 1-101, July 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
38 | Robert E. Gilligan, Susan Thomson 0002, Jim Bound, W. Richard Stevens |
Basic Socket Interface Extensions for IPv6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RFC ![In: RFC 2553, pp. 1-41, March 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Charles E. Perkins, Jim Bound |
DHCP for IPv6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the Third IEEE Symposium on Computers and Communications (ISCC 1998), June 30 - July 2, 1998, Athens, Greece, pp. 493-497, 1998, IEEE Computer Society, 0-8186-8538-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
38 | Paul Vixie, Susan Thomson 0002, Yakov Rekhter, Jim Bound |
Dynamic Updates in the Domain Name System (DNS UPDATE). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RFC ![In: RFC 2136, pp. 1-26, April 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
38 | Robert E. Gilligan, Susan Thomson 0002, Jim Bound, W. Richard Stevens |
Basic Socket Interface Extensions for IPv6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RFC ![In: RFC 2133, pp. 1-32, April 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
38 | Daniel T. Harrington, James P. Bound, John J. McCann, Matt Thomas |
Internet Protocol Version 6 and the Digital UNIX Implementation Experience. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Digit. Tech. J. ![In: Digit. Tech. J. 8(3), 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
|
38 | Jim Bound, Brian E. Carpenter, Daniel T. Harrington, Jack Houldsworth, Alan Lloyd |
OSI NSAPs and IPv6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RFC ![In: RFC 1888, pp. 1-16, August 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
38 | Jim Bound |
IPng BSD Host Implementation Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RFC ![In: RFC 1682, pp. 1-10, August 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
38 | William A. J. Bound |
Discussing security with top management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Secur. ![In: Comput. Secur. 7(2), pp. 129-130, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
38 | William A. J. Bound, Dennis R. Ruth |
Making risk analysis a useful management tool with microcomputer electronic worksheet packages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Secur. ![In: Comput. Secur. 2(2), pp. 102-115, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
37 | Gil Wiechman, Igal Sason |
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(5), pp. 1962-1990, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Yunpeng Pan, Leyuan Shi |
On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 110(3), pp. 543-559, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Time-indexing, Scheduling, Combinatorial optimization |
35 | Débora P. Ronconi |
A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 138(1), pp. 53-65, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
lower bound, branch-and-bound, blocking, makespan, flowshop |
35 | Satoshi Fujita, Masayuki Masukawa, Shigeaki Tagashira |
A Fast Branch-and-Bound Scheme for the Multiprocessor Scheduling Problem with Communication Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 32nd International Conference on Parallel Processing Workshops (ICPP 2003 Workshops), 6-9 October 2003, Kaohsiung, Taiwan, pp. 104-, 2003, IEEE Computer Society, 0-7695-2018-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
lower bound on the execution time, Branch-and-bound algorithm, communication time, multiprocessor scheduling problem |
35 | Ahmed El-Amawy |
Clocking Arbitrarily Large Computing Structures Under Constant Skew Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(3), pp. 241-255, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
constant skew bound, arbitrarily large computing structures, communicating cells, skew upper bound, maximum clocking rate, 2-D mesh framework, node design, nonplanar structures, parallel architectures, stability, hypercubes, network topology, synchronisation, hypercube networks, clocks, clock skew, global synchronization |
34 | Firouz Behnamfar, Fady Alajaji, Tamás Linder |
An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 55(6), pp. 1093-1098, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Alex S. Fukunaga |
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008, Paris, France, May 20-23, 2008, Proceedings, pp. 82-96, 2008, Springer, 978-3-540-68154-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Sumit Gulwani, Florian Zuleger |
The reachability-bound problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, Toronto, Ontario, Canada, June 5-10, 2010, pp. 292-304, 2010, ACM, 978-1-4503-0019-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
disjunctive invariants, resource bound analysis, pattern matching, transitive closure, ranking functions |
33 | Deji Chen 0001, Aloysius K. Mok, Tei-Wei Kuo |
Utilization Bound Re-visited . ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 6th International Workshop on Real-Time Computing and Applications Symposium (RTCSA '99), 13-16 December 1999, Hong Kong, China, pp. 295-302, 1999, IEEE Computer Society, 0-7695-0306-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Scheduling, Utilization bound |
33 | Michel Langevin, Eduard Cerny |
A recursive technique for computing lower-bound performance of schedules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 1(4), pp. 443-455, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
lower-bound on performance, microcode optimization, scheduling, resource constraints, dataflow graph |
33 | Dipankar Sarkar 0001, S. C. De Sarkar |
A Set of Inference Rules for Quantified Formula Handling and Array Handling in Verification of Programs Over Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(11), pp. 1368-1381, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
quantified formula handling, array handling, undecidability problem, automated verifier, quantified formulas, bound-extension rule, bound-modification, theorem proving, program verification, program verification, first-order logic, inference mechanisms, decidability, inference rules, integer arithmetic |
32 | Kai Kwong Lau, Mohan J. Kumar, N. R. Achuthan |
Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 247-253, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
parallel branch and bound, super-linear speedup, real time, load balancing, optimisation, Networks of Workstations, vehicle routing problem, VRP, operations research, operational research, branch and bound algorithm |
32 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam |
The price of anarchy in network creation games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pp. 292-298, 2007, ACM, 978-1-59593-616-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
routing, nash equilibrium, network design, price of anarchy |
31 | Cong Ling 0001 |
Generalized Union Bound for Space-Time Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 55(1), pp. 90-99, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Yufeng Wu, Dan Gusfield |
A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 16-26, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Zhaoxuan Shen, Ching-Chuen Jong |
Functional area lower bound and upper bound on multicomponentselection for interval scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(7), pp. 745-759, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Heeralal Janwa, Arbind K. Lal |
On Generalized Hamming Weights and the Covering Radius of Linear Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings, pp. 347-356, 2007, Springer, 978-3-540-77223-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Generalized Hamming weights, chain condition, generalized Griesmer bound, covering radius, cyclic codes, optimal codes, Griesmer bound |
30 | Teresa Alsinet, Felip Manyà, Jordi Planes |
A Max-SAT Solver with Lazy Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IBERAMIA ![In: Advances in Artificial Intelligence - IBERAMIA 2004, 9th Ibero-American Conference on AI, Puebla, Mexico, November 22-26, 2004, Proceedings, pp. 334-342, 2004, Springer, 3-540-23806-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
data structures, heuristics, lower bound, branch and bound, Max-SAT |
29 | Arnaud Venet, Guillaume P. Brat |
Precise and efficient static array bound checking for large embedded C programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation 2004, Washington, DC, USA, June 9-11, 2004, pp. 231-242, 2004, ACM, 1-58113-807-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
difference-bound matrices, abstract interpretation, program verification, pointer analysis, array-bound checking |
29 | Dong-Won Park, Swaminathan Natarajan, Arkady Kanevsky, Myung Jun Kim |
A generalized utilization bound test for fixed-priority real-time scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 2nd International Workshop on Real-Time Computing Systems and Applications, October 25 - 27, 1995, Tokyo, Japan, pp. 73-, 1995, IEEE Computer Society, 0-8186-7106-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
generalized utilization bound test, fixed-priority real-time scheduling, utilization bound test, rate-monotonic priority assignment, exact schedulability criterion, task deadlines, linear programming, linear programming, processor scheduling, multiprogramming |
29 | Richard Cleve, John Watrous |
Fast parallel circuits for the quantum Fourier transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 526-536, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
fast parallel circuits, quantum Fourier transform, QFT, circuit depth, constant error, depth bound, polynomial size, classical polynomial-time processing, depth complexity, arbitrary modulus, lower bound, theorem proving, quantum computing, Fourier transforms, upper bound, circuit complexity, circuit complexity, quantum circuits, factoring algorithm |
29 | Nancy A. Lynch |
Simulation Techniques for Proving Properties of Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REX School/Symposium ![In: A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium, Noordwijkerhout, The Netherlands, June 1-4, 1993, Proceedings, pp. 375-424, 1993, Springer, 3-540-58043-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
timing-based system, untimed system, invariant assertion, progress function, execution correspondence, Simulation, real-time system, lower bound, invariant, mutual exclusion, upper bound, clock synchronization, leader election, time bound |
29 | Ramesh Krishnamurti |
An Approximation Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(12), pp. 1572-1579, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
parameter dependent bound, asymptotically tight bound, partition sizes, partitionable multiprocessor systems, multiple partitions, minimum completion time schedule, worst-case performance bound, scheduling, parallel algorithms, computational complexity, approximation algorithm, parallelization, controller, multiprocessing systems, NP-hard, task scheduling, polynomial time algorithm, processors, multiprocessing programs |
29 | Fang-Wei Fu 0001, Shu-Tao Xia |
The characterization of binary constant weight codes meeting the bound of Fu and Shen. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 43(1), pp. 9-20, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
05B30, 05B05, AMS Classifications 94B65 |
29 | Olav Geil, Christian Thommesen |
On the Feng-Rao Bound for Generalized Hamming Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings, pp. 295-306, 2006, Springer, 3-540-31423-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Lap-Chung Lam, Tzi-cker Chiueh |
Checking Array Bound Violation Using Segmentation Hardware. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSN ![In: 2005 International Conference on Dependable Systems and Networks (DSN 2005), 28 June - 1 July 2005, Yokohama, Japan, Proceedings, pp. 388-397, 2005, IEEE Computer Society, 0-7695-2282-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Ilia Rapoport, Yaakov Oshman |
A new estimation error lower bound for interruption indicators in systems with uncertain measurements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 50(12), pp. 3375-3384, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Giri Tiruvuri, Moon Chung |
Estimation of lower bounds in scheduling algorithms for high-level synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 3(2), pp. 162-180, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
lower-bound estimated, scheduling, dynamic programming, high-level synthesis |
28 | S. Murtaza, Alfons G. Hoekstra, Peter M. A. Sloot |
Compute Bound and I/O Bound Cellular Automata Simulations on FPGA Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Reconfigurable Technol. Syst. ![In: ACM Trans. Reconfigurable Technol. Syst. 1(4), pp. 23:1-23:21, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
FPGA-based hardware accelerator, lattice Boltzman simulations, High-performance computing, cellular automata |
28 | Xiuzhen Huang, Jing Lai |
Maximum Common Subgraph: Upper Bound and Lower Bound Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMSCCS (1) ![In: Interdisciplinary and Multidisciplinary Research in Computer Science, IEEE CS Proceeding of the First International Multi-Symposium of Computer and Computational Sciences (IMSCCS|06), June 20-24, 2006, Zhejiang University, Hangzhou, China, Vol. 1, pp. 40-47, 2006, IEEE Computer Society, 0-7695-2581-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Zi Li, Yueming Cai |
Maximum-likelihood detection based on branch and bound algorithm for MIMO systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 51(3), pp. 306-319, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
active set, branch and bound, detection, Cholesky factorization, multiple-input multiple-output (MIMO), dual |
28 | Thi Viet Nga Nguyen, François Irigoin |
Efficient and effective array bound checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 27(3), pp. 527-570, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
interprocedural analysis, Array bound checking |
28 | Miodrag J. Mihaljevic, Marc P. C. Fossorier, Hideki Imai |
A Novel Broadcast Encryption Based on Time-Bound Cryptographic Keys. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DRMTICS ![In: Digital Rights Management: Technologies, Issues, Challenges and Systems, First International Conference, DRMTICS 2005, Sydney, Australia, October 31 - November 2, 2005, Revised Selected Papers, pp. 258-276, 2005, Springer, 3-540-35998-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
time-limited services, cryptographic keys management, time-bound keys, one-way mappings, broadcast encryption, pseudorandom number generators |
28 | Stefan Tschöke, Reinhard Lüling, Burkhard Monien |
Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 182-189, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
distributed branch-and-bound algorithm, 1024 processor network, 1-tree relaxation, direct-neighbor dynamic load-balancing strategy, parallel algorithms, parallelization, travelling salesman problems, travelling salesman problem, massively parallel computer, sequential algorithm |
27 | Minseok Song 0001, Naehyuck Chang, Heonshik Shin |
A new queue discipline for various delay and jitter requirements in real-time packet-switched networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 7th International Workshop on Real-Time Computing and Applications Symposium (RTCSA 2000), 12-14 December 2000, Cheju Island, South Korea, pp. 191-198, 2000, IEEE Computer Society, 0-7695-0930-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
fairness requirements, real-time packet-switched networks, data packet scheduling, service priority, jitter bound, Rate-controlled Frame-based Weighted Round Robin, frame-based WRR server, constant buffer space, scheduling, asynchronous transfer mode, delays, queueing theory, packet switching, bandwidth, ATM networks, rate controller, jitter, telecommunication traffic, end-to-end delays, delay bound |
27 | Jürgen Bierbrauer, Holger Schellwat |
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings, pp. 533-544, 2000, Springer, 3-540-67907-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Low bias, almost independent arrays, Hermitian codes, Suzuki codes, Weil-Carlitz-Uchiyama bound, exponential sum method, Zyablov bound, authentication, Fourier transform, hashing, resiliency, Reed-Solomon codes |
27 | Yahui Zhu, Mohan Ahuja |
On Job Scheduling on a Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(1), pp. 62-69, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
LDF algorithm, job preemption, minimum finish time schedule, list scheduling algorithm, absolute bound, scheduling, computational complexity, distributed algorithms, lower bound, NP-complete, hypercube, hypercube networks, scheduling algorithms, job scheduling |
27 | Xian Cheng, Oliver C. Ibe |
Reliability of a Class of Multistage Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 3(2), pp. 241-246, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
extra-stage interconnectionnetworks, fault-free path, input-output pair, networkreliability, broadcast reliability, recursive expression, lower bound, probability, multiprocessor interconnection networks, upper bound, multistage interconnection networks, tight bounds, reliability theory, terminal reliability |
27 | Shao Liu, Minghua Chen 0001, Sudipta Sengupta, Mung Chiang, Jin Li 0001, Philip A. Chou |
P2P Streaming Capacity under Node Degree Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 2010 International Conference on Distributed Computing Systems, ICDCS 2010, Genova, Italy, June 21-25, 2010, pp. 587-598, 2010, IEEE Computer Society, 978-0-7695-4059-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
P2P Streaming Capacity, Node Degree Bound, Node Out-Degree Bound, P2P Streaming |
27 | William S. Evans, Leonard J. Schulman |
Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 594-603, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
signal propagation, noisy formulas depth, information signal, exact bounds, decay, lower bound, Markov chains, upper bound |
27 | Jin-yi Cai, Martin Fürer, Neil Immerman |
An Optimal Lower Bound on the Number of Variables for Graph Identification ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 612-617, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
optimal lower bound, graph identification, lower bound, first-order logic |
27 | Rina Panigrahy, Kunal Talwar, Udi Wieder |
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 414-423, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Femke van Raamsdonk |
Higher-Order Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 220-239, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Enrico Paolini, Marc P. C. Fossorier, Marco Chiani |
Doubly-Generalized LDPC Codes: Stability Bound Over the BEC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(3), pp. 1027-1046, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Stéphanie Bay, Cédric Herzet, Jean-Marc Brossier, Jean-Pierre Barbot, Benoit Geller |
Analytic and Asymptotic Analysis of Bayesian Cramér-Rao Bound for Dynamical Phase Offset Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(1), pp. 61-70, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Iftach Haitner, Jonathan J. Hoch, Gil Segev 0001 |
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008., pp. 445-464, 2008, Springer, 978-3-540-78523-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Dominique Quadri, Éric Soutif, Pierre Tolla |
A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM (1) ![In: SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, pp. 456-464, 2007, Springer, 978-3-540-69506-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Syed Ali Jafar, Andrea J. Goldsmith |
Isotropic fading vector broadcast Channels: The scalar upper bound and loss in degrees of freedom. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(3), pp. 848-857, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Tarek F. Abdelzaher, Vivek Sharma 0004, Chenyang Lu 0001 |
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(3), pp. 334-350, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks |
26 | Rajiv Gupta 0001 |
Optimizing Array Bound Checks Using Flow Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPLAS ![In: LOPLAS 2(1-4), pp. 135-150, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
available checks, check hoisting, very busy checks, dataflow analysis |
26 | Jun (Jim) Xu, Richard J. Lipton |
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM SIGCOMM 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 19-23, 2002, Pittsburgh, PA, USA, pp. 279-292, 2002, ACM, 1-58113-570-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
quality of service, computational complexity, decision tree, packet scheduling, delay bound |
26 | Jimmy Shinn-Hwa Wang, Wayne Wei-Ming Dai |
Transformation of min-max optimization to least-square estimation and application to interconnect design optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 1995 International Conference on Computer Design (ICCD '95), VLSI in Computers and Processors, October 2-4, 1995, Austin, TX, USA, Proceedings, pp. 664-670, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
min-max optimization transformation, interconnect design optimization, tighter bound, circuit layout CAD, minimisation, least squares approximations, multichip modules, multichip modules, least-square estimation, minimax techniques |
26 | Z. C. Xuan, K. H. Lee, Jaime Peraire |
A Posteriori Output Bound for Partial Differential Equations Based on Elemental Error Bound Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2003, International Conference, Montreal, Canada, May 18-21, 2003, Proceedings, Part I, pp. 1035-1044, 2003, Springer, 3-540-40155-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Franz Baader |
Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 86-97, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
25 | Andrew Paul Smith |
Fast construction of constant bound functions for sparse polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 43(2-3), pp. 445-458, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Constrained global optimization, Interval arithmetic, Relaxation, Lazy evaluation, Multivariate polynomials, Bernstein polynomials, Bound functions |
25 | Zhangzhi Zhang, Xiaoguang Dai, S. W. Cheung, T. I. Yuk |
A new union bound based on Hölder inequality for space-time codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, IWCMC 2009, Leipzig, Germany, June 21-24, 2009, pp. 1392-1396, 2009, ACM, 978-1-60558-569-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hölder inequality, union bound, space-time codes, PEP |
25 | Iwan M. Duursma, Radoslav Kirov |
An Extension of the Order Bound for AG Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 18th International Symposium, AAECC-18 2009, Tarragona, Catalonia, Spain, June 8-12, 2009. Proceedings, pp. 11-22, 2009, Springer, 978-3-642-02180-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
order bound, Suzuki curve, Algebraic geometric code |
25 | Sumit Gulwani, Sagar Jain, Eric Koskinen |
Control-flow refinement and progress invariants for bound analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, June 15-21, 2009, pp. 375-385, 2009, ACM, 978-1-60558-392-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
control-flow refinement, progress invariants, formal verification, program verification, termination, bound analysis |
25 | Krzysztof Walkowiak |
Branch-and-Bound Algorithm for Anycast Flow Assignment in Connection-Oriented Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings. Part III, pp. 319-329, 2007, Springer, 978-3-540-74482-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
branch-and-bound, anycast, connection-oriented network |
25 | Yutaka Jitsumatsu, Tohru Kohda |
Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETA ![In: Sequences and Their Applications - SETA 2006, 4th International Conference, Beijing, China, September 24-28, 2006, Proceedings, pp. 351-363, 2006, Springer, 3-540-44523-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Welch bound equality (WBE) sequence, total squared correlation (TSC), pulse shaping filter, asynchronous DS/CDMA system |
25 | Rui Fan 0004, Nancy A. Lynch |
An Omega (n log n) lower bound on the cost of mutual exclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pp. 275-284, 2006, ACM, 1-59593-384-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
lower bound techniques, information theory, time complexity, mutual exclusion |
25 | Pascal Babu, Laurent Péridy, Eric Pinson |
A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 129(1-4), pp. 33-46, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Lagrangian decomposition, scheduling, branch & bound |
25 | Keivan Navaie, Ahmad R. Sharafat |
An Upper Bound on Air Interface Blocking Probability in Multiservice CDMA Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Wirel. Inf. Networks ![In: Int. J. Wirel. Inf. Networks 10(2), pp. 111-116, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
multiservice CDMA, Blocking probability, Chernoff bound |
25 | Yanhong A. Liu, Gustavo Gomez |
Automatic Accurate Cost-Bound Analysis for High-Level Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 50(12), pp. 1295-1309, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
cost bound, performance analysis and measurements, program analysis and transformation, space analysis, timing analysis, time analysis, worst-case execution time, program optimization, Cost analysis |
25 | Jan Jonsson, Kang G. Shin |
A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 1997 International Conference on Parallel Processing (ICPP '97), August 11-15, 1997, Bloomington, IL, USA, Proceedings, pp. 158-165, 1997, IEEE Computer Society, 0-8186-8108-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
real-time scheduling precedence-constrained tasks, branch-and-bound strategy, multiprocessor systems, hard real-time systems |
25 | Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal |
An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 10th International Conference on VLSI Design (VLSI Design 1997), 4-7 January 1997, Hyderabad, India, pp. 531-533, 1997, IEEE Computer Society, 0-8186-7755-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
three-layer restricted dogleg routing model, nontrivial lower bound, channel routing problem, two-layer Manhattan routing model, three-layer no-dogleg HVH routing model, two-layer restricted dogleg routing model, vertical constraint graph, VLSI, polynomial time algorithm, VLSI design |
25 | Sanghyun Ahn, David Hung-Chang Du |
A Multicast Tree Algorithm Considering Maximum Delay Bound for Real-Time Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 21st Conference on Local Computer Networks, Minneapolis, Minnesota, USA, October 13-16, 1996, pp. 172-181, 1996, IEEE Computer Society, 0-8186-7617-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
multicast tree algorithm, maximum delay bound, multiple multicast tree concept, tree maintenance cost, DBMT problem, shortest path tree-based DBMT, minimal Steiner tree-based DBMT, MST DBMT, SPT DBMT, performance analysis, group communication, NP-hardness, heuristic algorithms, real-time applications, multicast routing, telecommunication traffic, real-time traffic |
25 | Michèle Dion, Marc Gengler, Stéphane Ubéda |
Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONPAR ![In: Parallel Processing: CONPAR 94 - VAPP VI, Third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6-8, 1994, Proceedings, pp. 359-370, 1994, Springer, 3-540-58430-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
modelization, complexity, parallel computing, combinatorial optimization, Branch and bound algorithm |
25 | Ronald Armstrong, Su Gao, Lei Lei |
A zero-inventory production and distribution problem with a fixed customer sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 159(1), pp. 395-414, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Zero-inventory production and distribution problem, Product lifespan, Branch and bound search procedure, Heuristic lower bound, Time windows |
25 | Teresa Alsinet, Felip Manyà, Jordi Planes |
An efficient solver for weighted Max-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 41(1), pp. 61-73, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Weighted Branch and bound, Data structures, Heuristics, Lower bound, Max-SAT |
25 | Cunsheng Ding, Mordecai J. Golin, Torleiv Kløve |
Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 30(1), pp. 73-84, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Welch bound, Karystinos-Pados bound, code division multiple access, codes, binary sequences |
25 | Ciprian Borcea, Ileana Streinu |
On the number of embeddings of minimally rigid graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002, pp. 25-32, 2002, ACM, 1-58113-504-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Cayley-Menger variety, lower bound, upper bound, graph embedding, rigidity, distance geometry |
25 | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks |
On the totalk-diameter of connection networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 96-106, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
k edge-disjoint paths, minimal sum of lengths, fault-tolerant routing problems, k-connected simple graph, total/sub k/-diameter, graph theory, lower bound, ATM networks, upper bound, nodes, compact routing, connection network |
25 | Aloysius K. Mok, Deji Chen 0001 |
A multiframe model for real-time tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS '96), December 4-6, 1996, Washington, DC, USA, pp. 22-29, 1996, IEEE Computer Society, 0-8186-7689-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
multiframe model, periodic task model, worst-case execution time bound, number sequence, preemptive fixed priority scheduling policy, scheduling, schedulability problem, utilization bound, real-time tasks |
25 | Kamal Kumar Jain, V. Rajaraman |
Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(8), pp. 879-886, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
lower time bound, upper time bound, multiprocessor optimal schedules, minimum processing time, directed acyclic task graph, worst case behavior, minimum processor number, randomly generated dense task graphs, scheduling, performance evaluation, parallel algorithms, parallel processing, directed graphs, minimisation |
25 | Shyamal K. Chowdhury |
The Mean Resequencing Delay for M/H_K/infty Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(12), pp. 1633-1638, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
mean resequencing delay, packet transmission times, Poisson stream, K-stage hyperexponential transmission time distribution, equal capacity links, asymptotic bound analysis, computer networks, queueing theory, packet switching, upper bound, electronic messaging, destination nodes |
24 | Satyanarayana V. Lokam |
Graph Complexity and Slice Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(1), pp. 71-88, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Itai Ashlagi, Shahar Dobzinski, Ron Lavi |
An optimal lower bound for anonymous scheduling mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 169-176, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
scheduling, incentive compatibility |
23 | Emanuele Viola, Avi Wigderson |
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 427-437, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Laura Bozzelli, Salvatore La Torre |
Decision Problems for Lower/Upper Bound Parametric Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 925-936, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Manfred Kunde |
A New Bound for Pure Greedy Hot Potato Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 49-60, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 24719 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|