Sciweavers

460 search results - page 80 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
PODC
2004
ACM
14 years 1 months ago
Gradient clock synchronization
We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clo...
Rui Fan, Nancy A. Lynch
CCR
2004
157views more  CCR 2004»
13 years 7 months ago
Designing BGP-based outbound traffic engineering techniques for stub ASes
Today, most multi-connected autonomous systems (AS) need to control the flow of their interdomain traffic for both performance and economical reasons. This is usually done by manu...
Steve Uhlig, Olivier Bonaventure
JNSM
2002
218views more  JNSM 2002»
13 years 7 months ago
An Agent-based Connection Management Protocol for Ad Hoc Wireless Networks
Realizing high volume of data transmission in real time communication in a highly dynamic architecture like Mobile Ad hoc Networks (MANET) still remains a major point of research....
Romit Roy Choudhury, Krishna Paul, Somprakash Band...
ROBOCOMM
2007
IEEE
14 years 2 months ago
Autonomous navigation of wireless robot swarms with covert leaders
— The integration of advanced computation, wireless communication, and control technologies has facilitated the creation of autonomous robot swarms for many civil and military ap...
Xiaofeng Han, Louis F. Rossi, Chien-Chung Shen