434 search results - page 57 / 87 » Constraint-Based Combinators for Local Search |
APWEB
2003
Springer
14 years 3 months ago
2003
Springer
Search engines are among the most important applications or services on the web. Most existing successful search engines use global ranking algorithms to generate the ranking of do...
CP
2008
Springer
13 years 12 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
ML
2006
ACM
13 years 10 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...
PAMI
2000
13 years 10 months ago
2000
I consider the problem of finding all the modes of a mixture of multivariate Gaussian distributions, which has applications in clustering and regression. I derive exact formulas f...
PPOPP
2006
ACM
14 years 4 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...