62 search results - page 2 / 13 » A completely dynamic algorithm for split graphs |
CC
1998
Springer
13 years 4 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
ASUNAM
2009
IEEE
13 years 10 months ago
2009
IEEE
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
ICRA
2002
IEEE
13 years 10 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
ESCIENCE
2007
IEEE
13 years 11 months ago
2007
IEEE
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...