Sciweavers

146 search results - page 13 / 30
» SAT-Based Complete Don't-Care Computation for Network Optimi...
Sort
View
CAMAD
2009
IEEE
14 years 1 months ago
Improving Federation Executions with Migrating HLA/RTI Central Runtime Components
— Simulation tools are popular in the design and study of communication systems and networks. The implementation of analytic distributed simulations commonly require a central en...
Ricardo Lent
INFOCOM
2010
IEEE
13 years 7 months ago
Distributed Resource Allocation for Synchronous Fork and Join Processing Networks
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
IPPS
2000
IEEE
14 years 3 days ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
IPSN
2005
Springer
14 years 2 months ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry
PODC
2009
ACM
14 years 9 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan