1033 search results - page 23 / 207 » The Relative History Heuristic |
ATVA
2006
Springer
15 years 3 months ago
2006
Springer
Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but require...
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We introduce a new approach to spellchecking for languages with extreme phonetic irregularities. The spelling for such languages can be significantly improved if knowledg...
EOR
2006
14 years 11 months 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...
AIR
2004
14 years 11 months ago
2004
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
IJCAI
2003
15 years 1 months ago
2003
Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especi...