Sciweavers

1410 search results - page 166 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
SEAL
1998
Springer
15 years 4 months ago
Co-evolution, Determinism and Robustness
Abstract. Robustness has long been recognised as a critical issue for coevolutionary learning. It has been achieved in a number of cases, though usually in domains which involve so...
Alan D. Blair, Elizabeth Sklar, Pablo Funes
COCO
2008
Springer
74views Algorithms» more  COCO 2008»
15 years 1 months ago
Approximation Resistant Predicates from Pairwise Independence
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
Per Austrin, Elchanan Mossel
ATAL
2010
Springer
15 years 26 days ago
Adversarial planning for large multi-agent simulations
We investigate planning for self-interested agents in large multi-agent simulations. We present two heuristic algorithms that exploit different domain-specific properties in order...
Viliam Lisý
ICML
2010
IEEE
15 years 25 days ago
Convergence, Targeted Optimality, and Safety in Multiagent Learning
This paper introduces a novel multiagent learning algorithm, Convergence with Model Learning and Safety (or CMLeS in short), which achieves convergence, targeted optimality agains...
Doran Chakraborty, Peter Stone
PRL
2008
97views more  PRL 2008»
14 years 11 months ago
Repairing self-confident active-transductive learners using systematic exploration
We consider an active learning game within a transductive learning model. A major problem with many active learning algorithms is that an unreliable current hypothesis can mislead...
Ron Begleiter, Ran El-Yaniv, Dmitry Pechyony