Sciweavers

3693 search results - page 140 / 739
» Paper on the Move
Sort
View
132
Voted
FAABS
2004
Springer
15 years 9 months ago
Two Formal Gas Models for Multi-agent Sweeping and Obstacle Avoidance
Abstract. The task addressed here is a dynamic search through a bounded region, while avoiding multiple large obstacles, such as buildings. In the case of limited sensors and commu...
Wesley Kerr, Diana F. Spears, William M. Spears, D...
132
Voted
GECCO
2003
Springer
107views Optimization» more  GECCO 2003»
15 years 8 months ago
Exploration of a Two Sided Rendezvous Search Problem Using Genetic Algorithms
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
T. Q. S. Truong, A. Stacey
SIGMOD
2010
ACM
267views Database» more  SIGMOD 2010»
15 years 8 months ago
Processing proximity relations in road networks
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
Zhengdao Xu, Hans-Arno Jacobsen
149
Voted
POPL
1999
ACM
15 years 8 months ago
Types for Mobile Ambients
An ambient is a named cluster of processes and subambients, which moves as a group. We describe type systems able to guarantee that certain ambients will remain immobile, and that ...
Luca Cardelli, Andrew D. Gordon
144
Voted
WG
1994
Springer
15 years 7 months ago
Fugitive-Search Games on Graphs and Related Parameters
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M...