161 search results - page 9 / 33 » Structural decompositions for problems with global constrain... |
CP
2004
Springer
15 years 5 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
119
click to vote
AAAI
2007
15 years 1 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
TALG
2010
14 years 10 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
120
click to vote
CONSTRAINTS
2008
14 years 11 months ago
2008
Bioinformatics aims at applying computer science methods to the wealth of data collected in a variety of experiments in life sciences (e.g. cell and molecular biology, biochemistry...
VLSM
2005
Springer
15 years 5 months ago
2005
Springer
We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow ...