2168 search results - page 181 / 434 » Randomized Algorithms and Complexity Theory |
140
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We present and evaluate a method for estimating the relevance and calibrating the values of parameters of an evolutionary algorithm. The method provides an information theoretic m...
140
Voted
NIPS
2001
15 years 5 months ago
2001
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
121
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
125
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
130
Voted
ROBOCUP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...