7228 search results - page 522 / 1446 » From Algorithmic to Subjective Randomness |
184
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
287
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
187
click to vote
ATAL
2005
Springer
16 years 14 days ago
2005
Springer
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
185
click to vote
GECCO
2005
Springer
16 years 14 days ago
2005
Springer
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
183
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...