76 search results - page 4 / 16 » Counting Solutions of Knapsack Constraints |
GECCO
2003
Springer
13 years 11 months ago
2003
Springer
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation ar...
ECCV
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
CP
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
CP
2004
Springer
13 years 11 months ago
2004
Springer
The contribution of this paper is in demonstrating the impact of AND/OR search spaces view on solutions counting. In contrast to the traditional (OR) search space view, the AND/OR ...