Sciweavers

2911 search results - page 317 / 583
» A Logic of Graph Constraints
Sort
View
CORR
2002
Springer
81views Education» more  CORR 2002»
15 years 6 months ago
Value withdrawal explanations: a theoretical tool for programming environments
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
Willy Lesaint
CP
2010
Springer
15 years 5 months ago
Domain Consistency with Forbidden Values
This paper presents a novel domain-consistency algorithm which does not maintain supports dynamically during propagation, but rather maintain forbidden values. It introduces the op...
Yves Deville, Pascal Van Hentenryck
CP
2009
Springer
16 years 7 months ago
Asynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
CVPR
2010
IEEE
1171views Computer Vision» more  CVPR 2010»
16 years 3 months ago
Geodesic Star Convexity for Interactive Image Segmentation
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
Varun Gulshan, Carsten Rother, Antonio Criminisi, ...
ICCAD
1997
IEEE
86views Hardware» more  ICCAD 1997»
15 years 11 months ago
Micro-preemption synthesis: an enabling mechanism for multi-task VLSI systems
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...
Kyosun Kim, Ramesh Karri, Miodrag Potkonjak