Sciweavers

937 search results - page 102 / 188
» On the Complexity of Partial Order Properties
Sort
View
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 10 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
145
Voted
ECOOP
2006
Springer
15 years 9 months ago
A Semantic Analysis of C++ Templates
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...
Jeremy G. Siek, Walid Taha
140
Voted
WICSA
2001
15 years 7 months ago
A Compositional Approach for Constructing Connectors
Increasingly, systems are composed from independently developed parts, and mechanisms that allow those parts to interact (connectors). In many situations, specialized forms of int...
Bridget Spitznagel, David Garlan
CEC
2007
IEEE
15 years 6 months ago
Entropy-based Memetic Particle Swarm Optimization for computing periodic orbits of nonlinear mappings
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
186
Voted
INFOCOM
2006
IEEE
16 years 5 days ago
The Concurrent Matching Switch Architecture
Abstract— Network operators need high capacity router architectures that can offer scalability, provide throughput guarantees, and maintain packet ordering. However, current cent...
Bill Lin, Isaac Keslassy