Sciweavers

27 search results - page 3 / 6
» coco 2004
Sort
View
COCO
2005
Springer
77views Algorithms» more  COCO 2005»
13 years 10 months ago
On the Sensitivity of Cyclically-Invariant Boolean Functions
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n1/3 ). This result answers two previously published questions. Tur´an (1984) asked if ...
Sourav Chakraborty
IEAAIE
2004
Springer
13 years 10 months ago
The Cognitive Controller: A Hybrid, Deliberative/Reactive Control Architecture for Autonomous Robots
Abstract. The Cognitive Controller (CoCo) is a new, three-tiered control architecture for autonomous agents that combines reactive and deliberative components. A behaviour-based re...
Faisal Qureshi, Demetri Terzopoulos, Ross Gillett
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
13 years 10 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
COCO
2004
Springer
106views Algorithms» more  COCO 2004»
13 years 10 months ago
Separating Complexity Classes Using Structural Properties
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
Harry Buhrman, Leen Torenvliet
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
13 years 10 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek