Sciweavers

161 search results - page 6 / 33
» Structural decompositions for problems with global constrain...
Sort
View
CSCLP
2007
Springer
15 years 3 months ago
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
Pavel Surynek
CP
2009
Springer
15 years 4 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
CSCLP
2005
Springer
15 years 3 months ago
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
Thom W. Frühwirth
CVPR
2012
IEEE
13 years 3 months ago
Branch-and-price global optimization for multi-view multi-object tracking
We present a new algorithm to jointly track multiple objects in multi-view images. While this has been typically addressed separately in the past, we tackle the problem as a single...
Laura Leal-Taixe, Gerard Pons-Moll, Bodo Rosenhahn
ICTAI
2006
IEEE
15 years 3 months ago
Finding Crucial Subproblems to Focus Global Search
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
Susan L. Epstein, Richard J. Wallace