Sciweavers

51 search results - page 9 / 11
» A Kernighan-Lin Local Improvement Heuristic That Solves Some...
Sort
View
JAIR
2008
145views more  JAIR 2008»
13 years 6 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
CATS
2007
13 years 7 months ago
On The Complexity of Manipulating Elections
We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election’s outcome. All voting schemes are potentially manip...
Tom Coleman, Vanessa Teague
EVOW
2010
Springer
13 years 10 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
GECCO
2007
Springer
135views Optimization» more  GECCO 2007»
14 years 14 days ago
A cumulative evidential stopping criterion for multiobjective optimization evolutionary algorithms
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
Luis Martí, Jesús García, Ant...
ECAL
1999
Springer
13 years 10 months ago
Evolution of Neural Controllers with Adaptive Synapses and Compact Genetic Encoding
Abstract. This paper is concerned with arti cial evolution of neurocontrollers with adaptive synapses for autonomous mobile robots. The method consists of encoding on the genotype ...
Dario Floreano, Joseba Urzelai