2393 search results - page 311 / 479 » Bounds-Consistent Local Search |
117
click to vote
ML
2006
ACM
15 years 2 months ago
2006
ACM
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
129
click to vote
TEC
2010
14 years 9 months ago
2010
This paper identifies five distinct mechanisms by which a population-based algorithm might have an advantage over a solo-search algorithm in classical optimization. These mechanism...
139
Voted
BIBE
2006
IEEE
15 years 8 months ago
2006
IEEE
DNA sequence alignment is a critical step in identifying homology between organisms. The most widely used alignment program, ClustalW, is known to suffer from the local minima pro...
150
Voted
W2GIS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
108
click to vote
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...