6095 search results - page 404 / 1219 » Learning in Local Search |
145
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
162
click to vote
GECCO
2004
Springer
16 years 5 days ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
162
click to vote
CSC
2008
15 years 8 months ago
2008
- This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aidin...
153
click to vote
AMC
2008
15 years 7 months ago
2008
We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second i...
149
click to vote
COGSCI
2011
15 years 1 months ago
2011
This article examines cognitive process models of human sentence comprehension based on the idea of informed search. These models are rational in the sense that they strive to qui...