Sciweavers

14774 search results - page 489 / 2955
» Computational complexity and evolutionary computation
Sort
View
DLT
2009
15 years 4 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Aleksi Saarela
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
16 years 4 days ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 11 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
GECCO
2009
Springer
151views Optimization» more  GECCO 2009»
16 years 1 months ago
Evolution of functional specialization in a morphologically homogeneous robot
A central tenet of embodied artificial intelligence is that intelligent behavior arises out of the coupled dynamics between an agent’s body, brain and environment. It follows t...
Joshua S. Auerbach, Josh C. Bongard
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
16 years 1 months ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden