Sciweavers

1026 search results - page 82 / 206
» An Optimal Solution to Room Search Problem
Sort
View
ICML
1995
IEEE
16 years 7 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
ICIAR
2004
Springer
15 years 11 months ago
Reliable Dual-Band Based Contour Detection: A Double Dynamic Programming Approach
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries....
Mohammad Dawood, Xiaoyi Jiang, Klaus P. Schäf...
ATAL
2007
Springer
16 years 15 days ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
WIOPT
2005
IEEE
15 years 12 months ago
Iterated Local Optimization for Minimum Energy Broadcast
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
Intae Kang, Radha Poovendran
ICIC
2005
Springer
15 years 11 months ago
A Sequential Niching Technique for Particle Swarm Optimization
This paper proposed a modified algorithm, sequential niching particle swarm optimization (SNPSO), for the attempt to get multiple maxima of multimodal function. Based on the sequen...
Jun Zhang, Jing-Ru Zhang, Kang Li