88
Voted
COMPGEOM
2011
ACM
14 years 11 days ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
COLT
2008
Springer
14 years 10 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
WADS
2001
Springer
15 years 1 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
—In this paper, we propose a novel vertical handoff decision algorithm for overlay wireless networks consisting of cellular and wireless local area networks (WLANs). The target n...