Sciweavers

457 search results - page 73 / 92
» Agents as Catalysts for Mobile Computing
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Ants meeting algorithms
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech
IAT
2008
IEEE
14 years 2 months ago
A Pragmatic Approach to Realizing Context-Aware Personal Services
As network and computing technologies have improved, and the number of mobile devices has increased, realizing context-aware personal services has become one of the most important...
Sangkeun Lee, Dongjoo Lee, Seungseok Kang, Sang-go...
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
14 years 1 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
JNCA
2007
108views more  JNCA 2007»
13 years 8 months ago
Delivering adaptivity through context-awareness
Developing applications and deploying services for mobile users raises a number of issues and challenges that must be successfully addressed before the era of truly ubiquitous com...
Michael J. O'Grady, Gregory M. P. O'Hare, C. Donag...
JSAC
2008
98views more  JSAC 2008»
13 years 8 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri