Sciweavers

466 search results - page 67 / 94
» Fundamental Complexity of Optical Systems
Sort
View
FOCS
2002
IEEE
14 years 2 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
AROBOTS
2007
129views more  AROBOTS 2007»
13 years 9 months ago
Behaviors for physical cooperation between robots for mobility improvement
— A team of small, low-cost robots instead of a single large, complex robot is useful in operations such as search and rescue, urban exploration etc. However, the performance of ...
Ashish Deshpande, Jonathan E. Luntz
CN
2008
98views more  CN 2008»
13 years 9 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
DAWAK
2001
Springer
14 years 1 months ago
Matchmaking for Structured Objects
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
Thomas Eiter, Daniel Veit, Jörg P. Mülle...
USS
2008
13 years 11 months ago
NetAuth: Supporting User-Based Network Services
In User-Based Network Services (UBNS), the process servicing requests from user U runs under U's ID. This enables (operating system) access controls to tailor service authori...
Manigandan Radhakrishnan, Jon A. Solworth