Sciweavers

534 search results - page 13 / 107
» Power from Random Strings
Sort
View
CEC
2005
IEEE
14 years 1 months ago
Music evolution in a complex system of interacting agents
The evolution of music, from random note strings to certain “pleasant” note sequences, is traced in a multi-agent computational model. A community of agents, with some musical ...
Tao Gong, Qian Zhang, Hua Wu
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
TIT
2010
61views Education» more  TIT 2010»
13 years 2 months ago
Tunstall code, Khodak variations, and random walks
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, desig...
Michael Drmota, Yuriy A. Reznik, Wojciech Szpankow...
COLT
2005
Springer
14 years 28 days ago
Separating Models of Learning from Correlated and Uncorrelated Data
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...
Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andr...
ICGA
2007
89views Optimization» more  ICGA 2007»
13 years 7 months ago
Playing the Right Atari
We experimented a simple yet powerful optimization for Monte-Carlo Go tree search. It consists in dealing appropriately with strings that have two liberties. The heuristic is cont...
Tristan Cazenave