2252 search results - page 56 / 451 » Lower Bounds for Dynamic Algorithms |
ICPADS
1998
IEEE
13 years 12 months ago
1998
IEEE
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
DAM
2008
13 years 7 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
SUTC
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we propose an adaptive hybrid dynamic power management (AH-DPM) strategy based on a predictive shutdown scheme and an adaptive non-stationary stochastic process. Th...
TRANSCI
2011
13 years 2 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...