Sciweavers

198 search results - page 39 / 40
» Mobile Agents for Locating Documents in Ad Hoc Networks
Sort
View
CCCG
2008
13 years 6 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
13 years 10 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
AISADM
2005
Springer
13 years 11 months ago
Multi-agent Approach for Community Clustering Based on Individual Ontology Annotations
The paper presents peer-to-peer multi-agent framework for community clustering based on contact propagation in the global network of contacts with individual ontology-based descrip...
Dmitri Soshnikov
SOCIALCOM
2010
13 years 3 months ago
GDC: Group Discovery Using Co-location Traces
Smart phones can collect and share Bluetooth co-location traces to identify ad hoc or semi-permanent social groups. This information, known to group members but otherwise unavailab...
Steve Mardenfeld, Daniel Boston, Susan Juan Pan, Q...
DAGSTUHL
2003
13 years 6 months ago
Policies: Giving Users Control over Calls
Abstract. Features provide extensions to a basic service, but in new systems users require much greater flexibility oriented towards their needs. Traditional features do not easil...
Stephan Reiff-Marganiec