173 search results - page 14 / 35 » The Fastest and Shortest Algorithm for All Well-Defined Prob... |
225
Voted
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
165
click to vote
IEEEMSP
2002
IEEE
15 years 8 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
138
click to vote
EOR
2007
15 years 3 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
125
click to vote
JAIR
2002
15 years 3 months ago
2002
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a globa...
127
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...