Sciweavers

179 search results - page 16 / 36
» Routing for Energy Minimization in the Speed Scaling Model
Sort
View
GLOBECOM
2007
IEEE
14 years 1 months ago
A TDMA-based Scheduling and Routing Algorithm for Data-Centric Wireless Sensor Networks
—Recharging the batteries of a moribund sensor deployed as part of a wireless sensor network is often infeasible due to logistical considerations. With the purpose of prolonging ...
Yean-Fu Wen, Frank Yeong-Sung Lin, Hung-Shi Wang
GD
2004
Springer
14 years 29 days ago
Graph Drawing by Stress Majorization
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
Emden R. Gansner, Yehuda Koren, Stephen C. North
SPAA
2005
ACM
14 years 1 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
CVPR
2009
IEEE
15 years 2 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ASPDAC
2004
ACM
118views Hardware» more  ASPDAC 2004»
14 years 1 months ago
Fast and efficient voltage scheduling by evolutionary slack distribution
- To minimize energy consumption by voltage scaling in design of heterogeneousreal-time embeddedsystems, it is necessary to perfom two distinct tasks: task scheduling (TS) and volt...
Bita Gorjiara, Pai H. Chou, Nader Bagherzadeh, Meh...