Sciweavers

1968 search results - page 43 / 394
» The Complexity of Valued Constraint Models
Sort
View
120
Voted
AAAI
2007
15 years 7 months ago
Propagating Knapsack Constraints in Sublinear Time
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal ...
126
Voted
CP
2008
Springer
15 years 6 months ago
Length-Lex Bounds Consistency for Knapsack Constraints
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
Yuri Malitsky, Meinolf Sellmann, Willem Jan van Ho...
IWCM
2004
Springer
15 years 10 months ago
Tracking Complex Objects Using Graphical Object Models
We present a probabilistic framework for component-based automatic detection and tracking of objects in video. We represent objects as spatio-temporal two-layer graphical models, w...
Leonid Sigal, Ying Zhu, Dorin Comaniciu, Michael J...
IJCAI
2007
15 years 6 months ago
The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
Alan M. Frisch, Matthew Grum, Christopher Jefferso...
165
Voted
CONEXT
2008
ACM
15 years 6 months ago
Towards systematic design of enterprise networks
Enterprise networks are important, with size and complexity even surpassing carrier networks. Yet, the design of enterprise networks remains ad-hoc and poorly understood. In this p...
Yu-Wei Eric Sung, Sanjay G. Rao, Geoffrey G. Xie, ...