Research Publications
All | |
| Narrow your search | 271 result(s) |
By Type
By Year By Research Group | In 2007, Bessiere et al. have proposed a framework for learning constraint networks via membership queries, that is, by asking the user to classify total assignments of the variables as positive or negative. In this paper we consider the case where the ... We describe an approach to computing upper bounds on the lengths of solutions to reachability problems in transition systems. It is based on a decomposition of state-variable dependency graphs (causal graphs). Our approach is able to find prac- ... A significant portion of the electricity network capacity is built to run only a few days a year when demand peaks. As a result, expensive power generation plants and equipment costing millions of dollars are sitting idle most of the time, which increases... The next generation of power systems face significant challenges, both in coping with increased loading of an aging infrastructure and incorporating renewable energy sources. Meeting these challenges requires a fundamental change in the operation of power... In social choice settings with strict preferences, random dictatorship rules were characterized by Gibbard [1977] as the only randomized social choice functions that satisfy strategyproofness and ex post eciency. In the more general domain with indi... Constraint satisfaction problems may be nearly tractable. For instance, when the set of relations of a problem is a known tractable language with a few extra relations outside of this language. However, such an observation is in general of little use.... The FOCUS constraint expresses the opposite notion than balancing. In practice, this constraint suffers from the rigidity of its semantics. To tackle this issue, we propose three constraints that generalize FOCUS. We provide for each one a complete ... In the paper we investigate computational complexity of two global constraints, the cumulative constraint and the InterDistance constraint, that are key constraints in modeling and solving scheduling problems. Enforcing domain consistency on these ... We consider a simple sequential allocation procedure for sharing indivisible goods between agents in which agents take turns to pick item. Supposing additive utilities and independence between the agents, we show that the expected social welfare can be... AI planners have to compromise between the speed of the planning process and the quality of the generated plan. Planners based on greedy heuristic search are often able to find plans quickly, but the quality of their solutions is often poor. Planners ... |