Sciweavers

862 search results - page 154 / 173
» Random Information Spread in Networks
Sort
View
CP
2007
Springer
15 years 3 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
CN
2007
154views more  CN 2007»
14 years 11 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
JCP
2008
120views more  JCP 2008»
14 years 11 months ago
Multimedia Resource Replication Strategy for a Pervasive Peer-to-Peer Environment
The computer world is experiencing a paradigm shift towards context-aware pervasive computing, where diverse computer devices communicate with each other through different network ...
Letian Rong
JAIR
2006
74views more  JAIR 2006»
14 years 11 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 6 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari