Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
Dale Schuurmans, Finnegan Southey, Robert C. Holte
Planning by forward chaining through the world space has long been dismissed as being "obviously" infeasible. Nevertheless, this approach to planning has many advantages...
In this report we describe our model of dynamic hypertext and how the ClickIR system uses this model to assist users in interactive search. The system was used in both the ad hoc ...
Selecting an optimum maintenance policy independent of other parameters of the production system does not always yield the overall optimum operating conditions. For instance, high...
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
William W. Cohen, Robert E. Schapire, Yoram Singer