Sciweavers

2252 search results - page 227 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
GLOBECOM
2007
IEEE
15 years 10 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
SIGCOMM
1996
ACM
15 years 8 months ago
Adaptive Resource Management Algorithms for Indoor Mobile Computing Environments
Emerging indoor mobile computing environments seek to provide a user with an advanced setofcommunication-intensive applications, which require sustained quality of service in the ...
Songwu Lu, Vaduvur Bharghavan
ISMB
1993
15 years 5 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
15 years 8 months ago
On-Line Multicasting in All-Optical Networks
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno
203
Voted
ISLPED
1996
ACM
72views Hardware» more  ISLPED 1996»
15 years 8 months ago
Simultaneous buffer and wire sizing for performance and power optimization
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
Jason Cong, Cheng-Kok Koh, Kwok-Shing Leung