2398 search results - page 152 / 480 » Constraint Programming and Graph Algorithms |
186
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
155
click to vote
PLDI
2004
ACM
15 years 11 months ago
2004
ACM
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...
186
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
162
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...
166
click to vote
ICES
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents a methodology to design optimized electronic systems from high abstraction level descriptions. The methodology uses Genetic Programming in addition to high-leve...