4229 search results - page 349 / 846 » On the Optimality of Spiral Search |
183
click to vote
JMLR
2010
15 years 1 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
181
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
159
click to vote
MICCAI
2006
Springer
16 years 7 months ago
2006
Springer
We propose a novel trace-based method to extract vessel axes from gray-scale angiograms without preliminary segmentations. Our method traces the axes on an optimization framework w...
185
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
176
click to vote
ISBI
2006
IEEE
16 years 7 months ago
2006
IEEE
In this work we propose a novel rigid image registration approach to determine the position of high-resolution molecular structures in medium-resolution macromolecular complexes. ...