2899 search results - page 267 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
174
Voted
NIPS
2007
15 years 8 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
189
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper describes an extension to a speciation-based particle swarm optimizer (SPSO) to improve performance in dynamic environments. The improved SPSO has adopted several prove...
141
Voted
RAS
2006
15 years 6 months ago
2006
This paper describes an algorithm to calculate near-optimal minimum time trajectories for four wheeled omnidirectional vehicles, which can be used as part of a high-level path pla...
184
click to vote
ISPA
2005
Springer
16 years 5 days ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
167
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...