Sciweavers

224 search results - page 21 / 45
» G-graphs for the cage problem: a new upper bound
Sort
View
STACS
1999
Springer
15 years 10 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
TWC
2010
15 years 23 days ago
On the distribution of instantaneous power in single-carrier signals
Abstract-- This paper studies a statistical distribution of instantaneous power in pulse-shaped single-carrier (SC) modulation. Such knowledge is of significant importance to estim...
Makoto Tanahashi, Hideki Ochiai
AAAI
2006
15 years 7 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons
ATAL
2010
Springer
15 years 7 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
ICALP
2009
Springer
16 years 26 days ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...