Sciweavers

835 search results - page 96 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 1 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
NIPS
2008
14 years 11 months ago
Kernelized Sorting
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we...
Novi Quadrianto, Le Song, Alex J. Smola
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 4 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
ATAL
2006
Springer
15 years 1 months ago
Decentralized planning under uncertainty for teams of communicating agents
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A....
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
14 years 11 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...