Sciweavers

188 search results - page 6 / 38
» Back to the Complexity of Universal Programs
Sort
View
EUROGP
1999
Springer
13 years 11 months ago
Genetic Programming as a Darwinian Invention Machine
Genetic programming is known to be capable of creating designs that satisfy prespecified high-level design requirements for analog electrical circuits and other complex structures...
John R. Koza, Forrest H. Bennett III, Oscar Stiffe...
ICALP
1992
Springer
13 years 11 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
MAAMAW
1994
Springer
13 years 11 months ago
What Ants Cannot Do
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...
Eric Werner
ISCA
2005
IEEE
131views Hardware» more  ISCA 2005»
14 years 29 days ago
BugNet: Continuously Recording Program Execution for Deterministic Replay Debugging
Significant time is spent by companies trying to reproduce and fix the bugs that occur for released code. To assist developers, we propose the BugNet architecture to continuousl...
Satish Narayanasamy, Gilles Pokam, Brad Calder
UPP
2004
Springer
14 years 22 days ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner