Sciweavers

66 search results - page 11 / 14
» The Polytope of Tree-Structured Binary Constraint Satisfacti...
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
WACV
2005
IEEE
14 years 1 months ago
Image Segmentation by Unsupervised Sparse Clustering
In this paper, we present a novel solution of image segmentation based on positiveness by regarding the segmentation as one of the graph-theoretic clustering problems. On the cont...
Byoung-Ki Jeon, Yun-Beom Jung, Ki-Sang Hong
SAC
2006
ACM
13 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
AAAI
2006
13 years 9 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
KI
2002
Springer
13 years 7 months ago
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
Bernhard Nebel, Alexander Scivos