Sciweavers

657 search results - page 15 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 5 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
JCSS
2008
96views more  JCSS 2008»
14 years 11 months ago
Precedence constrained scheduling in (2 - 7/(3p+1)) optimal
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
Devdatta Gangal, Abhiram G. Ranade
INFOCOM
2005
IEEE
15 years 5 months ago
Power controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas
Abstract— We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is t...
Arindam Kumar Das, Robert J. Marks II, Payman Arab...
CORR
2010
Springer
177views Education» more  CORR 2010»
14 years 9 months ago
Dynamic Scheduling of Skippable Periodic Tasks with Energy Efficiency in Weakly Hard Real-Time System
Energy consumption is a critical design issue in real-time systems, especially in battery- operated systems. Maintaining high performance, while extending the battery life between...
Santhi Baskaran, P. Thambidurai
IWPEC
2004
Springer
15 years 5 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto