Sciweavers

7486 search results - page 1391 / 1498
» The Limits of Quantum Computers
Sort
View
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
16 years 1 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams
184
Voted
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
16 years 1 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
ESWS
2009
Springer
16 years 29 days ago
MoKi: The Enterprise Modelling Wiki
Abstract. Enterprise modelling focuses on the construction of a structured description, the so-called enterprise model, which represents aspects relevant to the activity of an ente...
Chiara Ghidini, Barbara Kump, Stefanie N. Lindstae...
GECCO
2009
Springer
111views Optimization» more  GECCO 2009»
16 years 29 days ago
Evolving quorum sensing in digital organisms
For centuries it was thought that bacteria live asocial lives. However, recent discoveries show many species of bacteria communicate in order to perform tasks previously thought t...
Benjamin E. Beckmann, Philip K. McKinley
IMC
2009
ACM
16 years 28 days ago
On calibrating enterprise switch measurements
The complexity of modern enterprise networks is ever-increasing, and our understanding of these important networks is not keeping pace. Our insight into intra-subnet traffic (sta...
Boris Nechaev, Vern Paxson, Mark Allman, Andrei Gu...
« Prev « First page 1391 / 1498 Last » Next »