Sciweavers

363 search results - page 14 / 73
» Decomposition of the NVALUE constraint
Sort
View
CP
2006
Springer
15 years 1 months ago
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
COR
2010
123views more  COR 2010»
14 years 9 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
60
Voted
ICASSP
2008
IEEE
15 years 4 months ago
Iterative R-D optimization of H.264
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. T...
Cheolhong An, Truong Q. Nguyen
CP
2006
Springer
15 years 1 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
147
Voted
CP
2009
Springer
15 years 10 months ago
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
Meinolf Sellmann