Sciweavers

874 search results - page 125 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
DCOSS
2008
Springer
13 years 9 months ago
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
Ryo Sugihara, Rajesh K. Gupta
ICS
2005
Tsinghua U.
14 years 1 months ago
Automatic generation and tuning of MPI collective communication routines
In order for collective communication routines to achieve high performance on different platforms, they must be able to adapt to the system architecture and use different algori...
Ahmad Faraj, Xin Yuan
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
14 years 1 days 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
BROADNETS
2006
IEEE
14 years 1 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
ICDCS
2000
IEEE
14 years 3 days ago
Task Assignment with Unknown Duration
We consider a distributed server system and ask which policy should be used for assigning tasks to hosts. In our server, tasks are not preemptible. Also, the task's service d...
Mor Harchol-Balter