10051 search results - page 1453 / 2011 » A Dynamic Separator Algorithm |
188
click to vote
SIGMETRICS
1998
ACM
15 years 6 months ago
1998
ACM
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
165
click to vote
TSMC
1998
15 years 6 months ago
1998
—An algorithmic solution method is presented for the problem of autonomous robot motion in completely unknown environments. Our approach is based on the alternate execution of tw...
175
click to vote
TC
2002
15 years 6 months ago
2002
Abstract--Personal communication service (PCS) networks offer mobile users multimedia applications with different quality-ofservice (QoS) and bandwidth requirements. This paper pro...
193
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes’ mobility in M...
178
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...