223 search results - page 19 / 45 » Approximate local search in combinatorial optimization |
SAT
2010
Springer
13 years 6 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
SAGA
2001
Springer
13 years 12 months ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
AAAI
2010
13 years 9 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
AUSAI
2004
Springer
14 years 28 days ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
LATIN
2004
Springer
14 years 27 days ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...