673 search results - page 26 / 135 » Approximate coherence-based reasoning |
114
Voted
CADE
2001
Springer
15 years 6 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
92
Voted
AIPS
2007
15 years 4 months ago
2007
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
129
click to vote
ESA
2001
Springer
15 years 6 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
109
click to vote
FUIN
2010
14 years 11 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
117
Voted
FLAIRS
2007
15 years 4 months ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...