890 search results - page 44 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
123
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
109
Voted
EOR
2008
15 years 2 months ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
112
click to vote
AAAI
2004
15 years 3 months ago
2004
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
113
click to vote
ICDM
2003
IEEE
15 years 7 months ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...