2398 search results - page 134 / 480 » Constraint Programming and Graph Algorithms |
159
click to vote
JDA
2006
15 years 5 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
121
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
152
Voted
IPMI
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
154
click to vote
ICCAD
1994
IEEE
15 years 9 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
161
click to vote
ASWEC
2005
IEEE
15 years 10 months ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...