376 search results - page 52 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
WEA
2004
Springer
14 years 1 months ago
2004
Springer
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
FQAS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. The Internet has instigated a critical need for automated tools that facilitate integrating countless databases. Since non-technical end users are often the ultimate repo...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
WABI
2005
Springer
14 years 1 months ago
2005
Springer
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
IJCAI
2003
13 years 9 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...