Sciweavers

734 search results - page 146 / 147
» A polynomial quantum algorithm for approximating the Jones p...
Sort
View
INFOCOM
2003
IEEE
13 years 11 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
EMSOFT
2007
Springer
13 years 9 months ago
A unified practical approach to stochastic DVS scheduling
This paper deals with energy-aware real-time system scheduling using dynamic voltage scaling (DVS) for energy-constrained embedded systems that execute variable and unpredictable ...
Ruibin Xu, Rami G. Melhem, Daniel Mossé
DCOSS
2006
Springer
13 years 9 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
ATMOS
2010
183views Optimization» more  ATMOS 2010»
13 years 4 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 4 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...