1206 search results - page 80 / 242 » Arc-Flags in Dynamic Graphs |
99
Voted
ICDCS
2003
IEEE
15 years 6 months ago
2003
IEEE
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
100
Voted
DISOPT
2006
15 years 23 days ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
100
click to vote
CORR
2008
Springer
15 years 25 days ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
116
Voted
ENTCS
2008
15 years 24 days ago
2008
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of th...
106
Voted
HPDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...