16091 search results - page 330 / 3219 » Solving |
153
click to vote
NIPS
2007
15 years 8 months ago
2007
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
159
click to vote
HIS
2004
15 years 8 months ago
2004
This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built ...
150
click to vote
ICAI
2004
15 years 8 months ago
2004
This paper describes a multi-robot system designed to use Bluetooth wireless communication to solve the "Honeybee" task. The Honeybee task is a simple search and navigat...
148
click to vote
FLAIRS
2003
15 years 8 months ago
2003
This paper demonstrates the feasibility of a word-based genetic algorithm (GA) for solving short substitution cryptograms such as the kind found in newspapers and puzzle books. Al...
161
click to vote
WSC
2004
15 years 8 months ago
2004
We present a new random search method for solving simulation optimization problems. Our approach emphasizes the need for maintaining the right balance between exploration and expl...