2398 search results - page 88 / 480 » Constraint Programming and Graph Algorithms |
176
click to vote
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
143
click to vote
ORL
1998
15 years 4 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
141
click to vote
ESOP
2010
Springer
16 years 2 months ago
2010
Springer
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
143
click to vote
SAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
128
click to vote
DIALM
2008
ACM
15 years 6 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...