Sciweavers

1199 search results - page 234 / 240
» Parameterized Proof Complexity
Sort
View
ISER
1995
Springer
100views Robotics» more  ISER 1995»
13 years 11 months ago
Distributed Robotic Manipulation: Experiments in Minimalism
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...
Karl-Friedrich Böhringer, Russell Brown, Bruc...
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
13 years 9 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola
ECOOP
2008
Springer
13 years 9 months ago
Safe Cross-Language Inheritance
Inheritance is a standard means for reuse and for interfacing with external libraries. In a multi-language software product, extending a class written in a statically-typed languag...
Kathryn E. Gray
ECOOP
2008
Springer
13 years 9 months ago
A Unified Framework for Verification Techniques for Object Invariants
Verification of object-oriented programs relies on object invariants which express consistency criteria of objects. The semantics of object invariants is subtle, mainly because of...
Sophia Drossopoulou, Adrian Francalanza, Peter M&u...
SIROCCO
2008
13 years 9 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...