12950 search results - page 177 / 2590 » On Optimal Timed Strategies |
151
click to vote
PVM
2005
Springer
15 years 9 months ago
2005
Springer
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...
120
click to vote
EUROGP
2001
Springer
15 years 8 months ago
2001
Springer
This paper describes how animat-based “food foraging” techniques may be applied to the design of low-level image processing algorithms. First, we show how we implemented the fo...
104
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
We propose a novel variant of the (1 + 1)-CMA-ES that updates the distribution of mutation vectors based on both successful and unsuccessful trial steps. The computational costs o...
139
click to vote
AAAI
2006
15 years 5 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
136
click to vote
IANDC
2006
15 years 4 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...