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...
As every user has his own idiosyncrasies and preferences, an interface that is honed for one user may be problematic for another. To accommodate a diverse range of users, many com...
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
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...
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...
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
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 ...
Selecting the right word translation among several options in the lexicon is a core problem for machine translation. We present a novel approach to this problem that can be traine...
This paper introduces a newwayof accelerating the convergenceof numericCSPfiltering algorithms, through the use of extrapolation methotis. Extrapolation methodsare used in numeric...
When humans produce summaries of documents, they do not simply extract sentences and concatenate them. Rather, they create new sentences that are grammatical, that cohere with one...