Sciweavers

1599 search results - page 124 / 320
» Algorithms for Parity Games
Sort
View
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 11 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
FOCS
1998
IEEE
15 years 10 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
15 years 8 months ago
Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly
DNA self-assembly has emerged as a rich and promising primitive for nano-technology. Experimental and analytical evidence indicates that such systems are prone to errors, and acco...
Ho-Lin Chen, Ashish Goel, Chris Luhrs
DM
2006
83views more  DM 2006»
15 years 6 months ago
A note on k-cop, l-robber games on graphs
We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are ...
Gena Hahn, Gary MacGillivray
NIPS
2004
15 years 8 months ago
New Criteria and a New Algorithm for Learning in Multi-Agent Systems
We propose a new set of criteria for learning algorithms in multi-agent systems, one that is more stringent and (we argue) better justified than previous proposed criteria. Our cr...
Rob Powers, Yoav Shoham