Sciweavers

882 search results - page 150 / 177
» On the Application of Evolutionary Algorithms to the Consens...
Sort
View
ICES
2010
Springer
148views Hardware» more  ICES 2010»
13 years 5 months ago
HyperNEAT for Locomotion Control in Modular Robots
Abstract. In an application where autonomous robots can amalgamate spontaneously into arbitrary organisms, the individual robots cannot know a priori at which location in an organi...
Evert Haasdijk, Andrei A. Rusu, A. E. Eiben
JACM
2007
160views more  JACM 2007»
13 years 7 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
RECOMB
1997
Springer
14 years 1 days ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 8 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
FSTTCS
2009
Springer
14 years 2 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi