Sciweavers

219 search results - page 14 / 44
» Optimal dyadic decision trees
Sort
View
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
14 years 3 months ago
Evolving cooperative strategies for UAV teams
We present a Genetic Programming approach to evolve cooperative controllers for teams of UAVs. Our focus is a collaborative search mission in an uncertain and/or hostile environme...
Marc D. Richards, L. Darrell Whitley, J. Ross Beve...
FOCS
2008
IEEE
13 years 10 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
ICAART
2010
INSTICC
14 years 7 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
WG
1998
Springer
14 years 2 months ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
ICML
2006
IEEE
14 years 11 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...