Sciweavers

657 search results - page 22 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
STACS
2007
Springer
15 years 5 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
LATIN
2010
Springer
15 years 4 months ago
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang
ISCIS
2005
Springer
15 years 5 months ago
Comparison of Hyper-DAG Based Task Mapping and Scheduling Heuristics for Wireless Sensor Networks
Abstract. In-network processing emerges as an approach to reduce energy consumption in Wireless Sensor Networks (WSN) by decreasing the overall transferred data volume. Parallel pr...
Yuan Tian, Füsun Özgüner, Eylem Eki...
RTCSA
2008
IEEE
15 years 6 months ago
Discrete Frequency Selection of Frame-Based Stochastic Real-Time Tasks
Energy-efficient real-time task scheduling has been actively explored in the past decade. Different from the past work, this paper considers schedulability conditions for stochas...
Vandy Berten, Chi-Ju Chang, Tei-Wei Kuo
ESA
2008
Springer
95views Algorithms» more  ESA 2008»
15 years 1 months ago
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...