Sciweavers

552 search results - page 42 / 111
» Lower bounds for dynamic connectivity
Sort
View
SUTC
2006
IEEE
14 years 3 months ago
An Adaptive Hybrid Dynamic Power Management Method
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...
Hung-Cheng Shih, Kuochen Wang
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
14 years 2 months ago
On the myopic policy for a class of restless bandit problems with applications in dynamic multichannel access
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
Keqin Liu, Qing Zhao
IJMC
2006
84views more  IJMC 2006»
13 years 9 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
ICALP
2007
Springer
14 years 3 months ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
WG
1992
Springer
14 years 1 months ago
On the Complexity of Partial Order Properties
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
Stefan Felsner, Dorothea Wagner