749 search results - page 73 / 150 » Dualities for Constraint Satisfaction Problems |
74
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
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...
66
Voted
KBS
2007
15 years 15 days ago
2007
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...
112
Voted
AAAI
1994
15 years 1 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
106
click to vote
ICDT
2010
ACM
15 years 4 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
110
click to vote
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
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...