2398 search results - page 218 / 480 » Constraint Programming and Graph Algorithms |
182
click to vote
FSTTCS
2007
Springer
16 years 20 days ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
142
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
240
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
170
click to vote
AAAI
2004
15 years 8 months ago
2004
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
135
click to vote
ICCD
2000
IEEE
16 years 3 months ago
2000
IEEE
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...