Sciweavers

1941 search results - page 257 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
MOBIHOC
2005
ACM
15 years 9 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
MOBIDE
2006
ACM
15 years 4 months ago
GPS-Free node localization in mobile wireless sensor networks
An important problem in mobile ad-hoc wireless sensor networks is the localization of individual nodes, i.e., each node’s awareness of its position relative to the network. In t...
Hüseyin Akcan, Vassil Kriakov, Hervé B...
BROADNETS
2007
IEEE
15 years 4 months ago
DIMPLE: DynamIc Membership ProtocoL for epidemic protocols
—Epidemic protocols assume that information of a random set of nodes is provided at each protocol round. By definition, the random set needs to be chosen uniformly and randomly ...
Jin Sun, Paul J. Weber, Byung Kyu Choi, Roger M. K...
SIGMETRICS
2006
ACM
114views Hardware» more  SIGMETRICS 2006»
15 years 4 months ago
On suitability of Euclidean embedding of internet hosts
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
Sanghwan Lee, Zhi-Li Zhang, Sambit Sahu, Debanjan ...