Sciweavers

2497 search results - page 170 / 500
» Requirements for models of achievable routing
Sort
View
MOBIHOC
2002
ACM
16 years 1 months ago
Performance evaluation of a fair backoff algorithm for IEEE 802.11 DFWMAC
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...
Zuyuan Fang, Brahim Bensaou, Yu Wang
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
15 years 11 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
IPTPS
2003
Springer
15 years 7 months ago
Rationality and Self-Interest in Peer to Peer Networks
Much of the existing work in peer to peer networking assumes that users will follow prescribed protocols without deviation. This assumption ignores the user’s ability to modify ...
Jeffrey Shneidman, David C. Parkes
DEBS
2008
ACM
15 years 3 months ago
Distributed automatic service composition in large-scale systems
Automatic service composition is an active research area in the field of service computing. This paper presents a distributed approach to automatically discover a composition of s...
Songlin Hu, Vinod Muthusamy, Guoli Li, Hans-Arno J...
DAGSTUHL
2003
15 years 3 months ago
On Evolutionary Design, Embodiment, and Artificial Regulatory Networks
In this contribution we consider the idea that successful evolutionary design is best achieved in a networked system. We exemplify this thought by a discussion of artificial regula...
Wolfgang Banzhaf