1639 search results - page 72 / 328 » Anytime Heuristic Search |
108
click to vote
COLING
1996
15 years 1 months ago
1996
We address here the treatment of metonymic expressions from a knowledge representation perspective, that is, in the context of a text understanding system which aims to build a co...
86
Voted
EOR
2006
15 years 17 days ago
2006
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
CP
2010
Springer
14 years 11 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
108
Voted
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
84
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...