14518 search results - page 10 / 2904 » Two Problems for Sophistication |
COMPGEOM
1991
ACM
13 years 11 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
GECCO
2003
Springer
14 years 25 days ago
2003
Springer
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 ...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
AML
2008
13 years 7 months ago
2008
We study problems of Clote and Paris, concerning the existence of end extensions of models of n-collection. We continue the study of the notion of ` -fullness', begun by Wilki...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
