Sciweavers

1257 search results - page 178 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
JSAC
2006
120views more  JSAC 2006»
14 years 10 months ago
A Tutorial on Cross-Layer Optimization in Wireless Networks
This tutorial paper overviews recent developments in optimization-based approaches for resource allocation problems in wireless systems. We begin by overviewing important results i...
Xiaojun Lin, Ness B. Shroff, R. Srikant
OPODIS
2010
14 years 8 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah
STACS
2005
Springer
15 years 3 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
WOWMOM
2009
ACM
204views Multimedia» more  WOWMOM 2009»
15 years 2 months ago
ECTC: Energy effiCient topology control algorithm for wireless sensor networks
Sensor network which operates on battery are used to gather data in a variety of environments. The data collected by each node is communicated through the network to the sink, whi...
Nedal Ababneh, Anastasios Viglas, Houda Labiod, Na...
JAIR
2007
141views more  JAIR 2007»
14 years 10 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf