This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
Computer modeling and simulation are indispensable for understanding the functioning of an organism on a molecular level. We present an implemented method for the qualitative simu...
In this paper, we present and compare automatically generated titles for machine-translated documents using several different statistics-based methods. A Na
One advantage of Case-Based Reasoning (CBR) is the relative ease of constructing and maintaining CBR systems, especially as a number of commercial CBR tools are available. However...
Parametric ordinary differential equations arise in many areas of science and engineering. Since some of the data is uncertain and given by intervals, traditional numerical method...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
Models of computer users that are learned on the basis of data can make use of two types of information: data about users in general and data about the current individual user. Fo...
We present a new approach to inferring a probability distribution which is incompletely specified by a number of linear constraints. We argue that the currently most popular appro...
A component-based generic agent architecture for multi-attribute (integrative) negotiation is introduced and its application is described in a prototype system for negotiation abo...