Sciweavers

AAAI
1996
13 years 5 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
AAAI
1996
13 years 5 months ago
Planning for Temporally Extended Goals
Fahiem Bacchus, Froduald Kabanza
AAAI
1996
13 years 5 months ago
Rewarding Behaviors
Markov decision processes (MDPs) are a very popular tool for decision theoretic planning (DTP), partly because of the welldeveloped, expressive theory that includes effective solu...
Fahiem Bacchus, Craig Boutilier, Adam J. Grove
AAAI
1996
13 years 5 months ago
Improving Case Retrieval by Remembering Questions
This paper discusses techniques that improve the performance of a case retrieval system, after it is deployed, as a result of the continued usage of the system, by remembering pre...
Richard Alterman, Daniel Griffin
AAAI
1996
13 years 5 months ago
Agent Modeling in Expert Critiquing Systems
Expert critiquing systems are a type of humancomputercollaborative system in which a computer agent presents reasoned opinions about a humanagent's problem-solving process fo...
Michael Chin-Ming Fu, Caroline C. Hayes
AAAI
1996
13 years 5 months ago
Coping with Temporal Constraints in Multimedia Presentation Planning
Computer-based presentation systems enable the realization of effective and dynamic presentation styles that incorporate multiple media. Obvious examples are animated user interfa...
Elisabeth André, Thomas Rist