1378 search results - page 11 / 276 » The Tractability of Global Constraints |
CSCLP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a g...
AIPS
2006
15 years 1 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
AIPS
2007
15 years 2 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
CDC
2009
IEEE
15 years 24 days ago
2009
IEEE
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
107
click to vote
PODS
2010
ACM
15 years 4 months ago
2010
ACM
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...