Sciweavers

196 search results - page 35 / 40
» Improving Placement under the Constant Delay Model
Sort
View
88
Voted
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 1 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
PERCOM
2006
ACM
15 years 9 months ago
A Multi-Commodity Flow Approach for Globally Aware Routing in Multi-Hop Wireless Networks
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
Vinay Kolar, Nael B. Abu-Ghazaleh
INFOCOM
2009
IEEE
15 years 4 months ago
Link Scheduling with QoS Guarantee for Wireless Relay Networks
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
Chi-Yao Hong, Ai-Chun Pang
IPPS
2009
IEEE
15 years 4 months ago
Power-aware dynamic task scheduling for heterogeneous accelerated clusters
Recent accelerators such as GPUs achieve better cost-performance and watt-performance ratio, while the range of their application is more limited than general CPUs. Thus heterogen...
Tomoaki Hamano, Toshio Endo, Satoshi Matsuoka
ASC
2011
14 years 4 months ago
Quality of Service constrained routing optimization using Evolutionary Computation
In this work, a novel optimization framework is proposed that allows the improvement of Quality of Service levels in TCP/IP based networks, by configuring the routing weights of ...
Miguel Rocha, Pedro Sousa, Paulo Cortez, Miguel Ri...