4229 search results - page 409 / 846 » On the Optimality of Spiral Search |
184
click to vote
GECCO
2003
Springer
16 years 1 days ago
2003
Springer
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation ar...
156
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
169
click to vote
AAAI
2008
15 years 9 months ago
2008
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
182
click to vote
IJCAI
2003
15 years 8 months ago
2003
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
192
click to vote
GLVLSI
2007
IEEE
15 years 7 months ago
2007
IEEE
Given a set of placed blocks, we present an algorithm that minimally spaces the blocks to ensure routability under several assumptions. By performing a binary search on total widt...