Sciweavers

597 search results - page 89 / 120
» Homomorphisms of random paths
Sort
View
INFOCOM
2006
IEEE
14 years 3 months ago
Looking at Large Networks: Coding vs. Queueing
— Traditionally, network buffer resources have been used at routers to queue transient packets to prevent packet drops. In contrast, we propose a scheme for large multi-hop netwo...
Sandeep Bhadra, Sanjay Shakkottai
NOMS
2006
IEEE
169views Communications» more  NOMS 2006»
14 years 3 months ago
Real-Time Measurement of End-to-End Available Bandwidth using Kalman Filtering
—This paper presents a new method, BART (Bandwidth Available in Real-Time), for estimating the end-toend available bandwidth over a network path. It estimates bandwidth quasi-con...
Svante Ekelin, Martin Nilsson, Erik Hartikainen, A...
MSN
2005
Springer
14 years 3 months ago
Using MDS Codes for the Key Establishment of Wireless Sensor Networks
Key pre-distribution techniques for security provision of Wireless Sensor Networks (WSNs) have attracted significant interests recently. In these schemes, a relatively small numbe...
Jing Deng, Yunghsiang S. Han
SPAA
2003
ACM
14 years 3 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
14 years 3 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom