2398 search results - page 121 / 480 » Constraint Programming and Graph Algorithms |
127
Voted
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
140
Voted
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
133
Voted
CP
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
147
click to vote
DAC
1997
ACM
15 years 9 months ago
1997
ACM
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
167
Voted
ECOOP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Generic types in C behave invariantly with respect to subtyping. We propose a system of type-safe variance for C that supports the declaration of covariant and contravari...