96 search results - page 5 / 20 » Combining Two Local Search Approaches to Hypergraph Partitio... |
111
click to vote
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...
AAAI
2010
15 years 1 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 ...
EVOW
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
EVOW
2007
Springer
15 years 5 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....