Sciweavers

12301 search results - page 2211 / 2461
» Distributed Computation in Dynamic Networks
Sort
View
EUROPAR
2001
Springer
15 years 8 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci
RTAS
1996
IEEE
15 years 8 months ago
AIDA-based real-time fault-tolerant broadcast disks
The proliferation of mobile computers and wireless networks requires the design of future distributed real-time applications to recognize and deal with the signi cant asymmetry be...
Azer Bestavros
INFOCOM
1992
IEEE
15 years 8 months ago
A Study on the Inaccessibility Characteristics of ISO 8802/4 Token-Bus LANs
Local area networks have long been established as the basis for distributed systems. Continuity of service and bounded and known message delivery latency are requirements of a num...
José Rufino, Paulo Veríssimo
USENIX
1994
15 years 5 months ago
Large Granularity Cache Coherence for Intermittent Connectivity
To function in mobile computing environments, distributed file systems must cope with networks that are slow, intermittent, or both. Intermittence vitiates the effectiveness of ca...
Lily B. Mummert, Mahadev Satyanarayanan
ATAL
2010
Springer
15 years 5 months ago
Generation and analysis of multiple futures with swarming agents
Most agent-based modeling techniques generate only a single trajectory in each run, greatly undersampling the space of possible trajectories. Swarming agents can explore a great m...
H. Van Dyke Parunak
« Prev « First page 2211 / 2461 Last » Next »