Sciweavers

AAAI
1998
13 years 6 months ago
A* with Bounded Costs
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
Brian Logan, Natasha Alechina
AAAI
1998
13 years 6 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
AAAI
1998
13 years 6 months ago
Extending GENET to Solve Fuzzy Constraint Satisfaction Problems
Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when app...
Jason H. Y. Wong, Ho-Fung Leung
AAAI
1998
13 years 6 months ago
BIG: A Resource-Bounded Information Gathering Agent
Effective information gathering on the WWW is a complex task requiring planning, scheduling, text processing, and interpretation-style reasoning about extracted data to resolve in...
Victor R. Lesser, Bryan Horling, Frank Klassner, A...
AAAI
1998
13 years 6 months ago
Learning Investment Functions for Controlling the Utility of Control Knowledge
The utility problem occurs when the cost of the acquired knowledge outweighs its bene ts. When the learner acquires control knowledge for speeding up a problem solver, the bene t ...
Oleg Ledeniov, Shaul Markovitch
AAAI
1998
13 years 6 months ago
Acceleration Methods for Numeric CSPs
This paper introduces a newwayof accelerating the convergenceof numericCSPfiltering algorithms, through the use of extrapolation methotis. Extrapolation methodsare used in numeric...
Yahia Lebbah, Olivier Lhomme
AAAI
1998
13 years 6 months ago
Reversible DAC and Other Improvements for Solving Max-CSP
Javier Larrosa, Pedro Meseguer, Thomas Schiex, G&e...
AAAI
1998
13 years 6 months ago
Two Forms of Dependence in Propositional Logic: Controllability and Definability
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula , if there...
Jérôme Lang, Pierre Marquis
AAAI
1998
13 years 6 months ago
Answering Questions for an Organization Online
TheWorldWideWebcontinues to challenge organizations to makeonline access to their expertise convenient for their clients. Onemeansof expertise access that manyclients find conveni...
Vladimir A. Kulyukin, Kristian J. Hammond, Robin D...
AAAI
1998
13 years 6 months ago
Feature Generation for Sequence Categorization
The problem of sequence categorization is to generalize from a corpus of labeled sequences procedures for accurately labeling future unlabeled sequences. The choice of representat...
Daniel Kudenko, Haym Hirsh