4229 search results - page 93 / 846 » On the Optimality of Spiral Search |
113
click to vote
LPAR
2005
Springer
15 years 6 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
ICPR
2006
IEEE
16 years 2 months ago
2006
IEEE
Circular shortest path algorithms for polar objects segmentation have been proposed in [1, 11, 10] to address discrete case and extended in [2] to the continuous domain for closed...
104
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
TSMC
1998
15 years 26 days ago
1998
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
105
click to vote
ICDAR
2011
IEEE
14 years 25 days ago
2011
IEEE
— This paper describes a lexicon-driven approach to on-line handwritten Japanese disease name recognition using a time-synchronous method. A trie lexicon is constructed from a di...