Sciweavers

6167 search results - page 82 / 1234
» Can Refinement be Automated
Sort
View
ICRA
1998
IEEE
91views Robotics» more  ICRA 1998»
15 years 8 months ago
Multi-Resolution Planning for Earthmoving
We suggest that planning for automated earthmoving operations such as digging a foundation or leveling a mound of soil, be treated at multiple levels. In a system that we have dev...
Sanjiv Singh, Howard Cannon
157
Voted
EWCBR
1998
Springer
15 years 8 months ago
Case-Based Reasoning in CARE-PARTNER: Gathering Evidence for Evidence-Based Medical Practice
This paper presents the CARE-PARTNER system. Functionally, it offers via the WWW knowledge-support assistance to clinicians responsible for the long-term follow-up of stem-cell pos...
Isabelle Bichindaritz, Emin Kansu, Keith M. Sulliv...
PLILP
1998
Springer
15 years 8 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
CSL
2008
Springer
15 years 4 months ago
User simulation in a stochastic dialog system
We present a new methodology of user simulation applied to the evaluation and refinement of stochastic dialog systems. Common weaknesses of these systems are the scarceness of the...
Francisco Torres, Emilio Sanchis, Encarna Segarra
CORR
2002
Springer
105views Education» more  CORR 2002»
15 years 3 months ago
Effectiveness of Preference Elicitation in Combinatorial Auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm