Sciweavers

749 search results - page 73 / 150
» Dualities for Constraint Satisfaction Problems
Sort
View
STACS
2005
Springer
15 years 4 months ago
The Core of a Countably Categorical Structure
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
Manuel Bodirsky
KBS
2007
75views more  KBS 2007»
14 years 11 months ago
Managing restaurant tables using constraints
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
AAAI
1994
15 years 11 days ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 3 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
ICCV
2007
IEEE
16 years 1 months ago
Normalized Cuts Revisited: A Reformulation for Segmentation with Linear Grouping Constraints
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
Anders P. Eriksson, Carl Olsson, Fredrik Kahl