Sciweavers

2419 search results - page 461 / 484
» Precise Distributed Localization Algorithms for Wireless Net...
Sort
View
133
Voted
SPAA
2004
ACM
15 years 7 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ATAL
2006
Springer
15 years 5 months ago
A utility-based sensing and communication model for a glacial sensor network
This paper reports on the development of a utility-based mechanism for managing sensing and communication in cooperative multi-sensor networks. The specific application considered...
Paritosh Padhy, Rajdeep K. Dash, Kirk Martinez, Ni...
SIGMETRICS
2003
ACM
165views Hardware» more  SIGMETRICS 2003»
15 years 7 months ago
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
Stephan Bohacek, João P. Hespanha, Junsoo L...
PVM
2010
Springer
15 years 10 days ago
Communication Target Selection for Replicated MPI Processes
Abstract. VolpexMPI is an MPI library designed for volunteer computing environments. In order to cope with the fundamental unreliability of these environments, VolpexMPI deploys tw...
Rakhi Anand, Edgar Gabriel, Jaspal Subhlok
JSSPP
2009
Springer
15 years 8 months ago
Contention-Aware Scheduling with Task Duplication
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
Oliver Sinnen, Andrea To, Manpreet Kaur