670 search results - page 25 / 134 » Inclusion-Based Approximate Reasoning |
120
Voted
ICCBR
2005
Springer
15 years 7 months ago
2005
Springer
CBR is one of the techniques that can be applied to the task of approximating a function over high-dimensional, continuous spaces. In Reinforcement Learning systems a learning agen...
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 ...
133
Voted
WAOA
2010
Springer
14 years 11 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
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...