Sciweavers

2796 search results - page 533 / 560
» The coolest path problem
Sort
View
LOGCOM
2007
89views more  LOGCOM 2007»
14 years 11 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
CCR
2004
84views more  CCR 2004»
14 years 11 months ago
On making SCTP robust to spurious retransmissions
Network anomalies such as packet reordering and delay spikes can result in spurious retransmissions and degrade performance of reliable transport protocols such as TCP and SCTP. P...
Sourabh Ladha, Stephan Baucke, Reiner Ludwig, Paul...
CN
2002
109views more  CN 2002»
14 years 11 months ago
A network infrastructure for IP mobility support in metropolitan areas
The original design of the Internet and its underlying protocols did not anticipate users to be mobile. With the growing interest in supporting mobile users and mobile computing, ...
Cristina Hristea, Fouad A. Tobagi
CDC
2010
IEEE
135views Control Systems» more  CDC 2010»
14 years 6 months ago
Synchronous rendezvous of very-low-range wireless agents
In this paper, we address the problem of temporal synchronization of a team of mobile agents on a set of rendezvous points defined by the nodes of a bipartite network. In particula...
Michael M. Zavlanos
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
14 years 6 months ago
Observational learning in an uncertain world
We study a model of observational learning in social networks in the presence of uncertainty about agents' type distributions. Each individual receives a private noisy signal ...
Daron Acemoglu, Munther A. Dahleh, Asuman E. Ozdag...