Sciweavers

12950 search results - page 270 / 2590
» On Optimal Timed Strategies
Sort
View
ISPAN
1999
IEEE
15 years 11 months ago
Complete Exchange Algorithms in Wormhole-Routed Torus Networks: A Divide-and-Conquer Strategy
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
Si-Gwan Kim, Seung Ryoul Maeng, Jung Wan Cho
ISMB
1996
15 years 8 months ago
Compact Encoding Strategies for DNA Sequence Similarity Search
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
David J. States, Pankaj Agarwal
CATA
2009
15 years 7 months ago
Comparison of Strategies for Serving Two Streams of Jobs
Highly varying job demands generally consist of many short jobs mixed with several long jobs. In this paper, we consider a simple scenario where two job streams with different lev...
Feng Zhang, Lester Lipsky, Sarah Tasneem, Steve Th...
TC
2008
15 years 6 months ago
An Availability-Aware Task Scheduling Strategy for Heterogeneous Systems
High availability is a key requirement in the design and development of heterogeneous systems, where processors operate at different speeds and are not continuously available for ...
Xiao Qin, Tao Xie 0004
MASS
2010
143views Communications» more  MASS 2010»
15 years 4 months ago
Know your neighborhood: A strategy for energy-efficient communication
Wireless sensor networks typically conserve energy by following a periodic wakeup-sleep schedule: nodes minimize idle time and spend most of their time in a low power sleep state. ...
Farhana Ashraf, Riccardo Crepaldi, Robin Kravets