Sciweavers

1925 search results - page 297 / 385
» Theory research at Google
Sort
View
P2P
2007
IEEE
161views Communications» more  P2P 2007»
16 years 15 days ago
The BitCod Client: A BitTorrent Clone using Network Coding
Network coding is an emerging field of research with sound and mature theory supporting it. Recent works shows that it has many benefits like improved fault tolerance, higher ...
Danny Bickson, Roy Borer
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 13 days ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 13 days ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
16 years 13 days 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
ICALP
2007
Springer
16 years 13 days ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson