82 search results - page 15 / 17 » Approximation Algorithms for Orienteering with Time Windows |
JCO
2006
13 years 7 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
PODS
2010
ACM
14 years 25 days ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
GECCO
2010
Springer
14 years 17 days ago
2010
Springer
This paper proposes an integrated approach to arrive at optimal build orientations, simultaneously minimizing surface roughness ‘Ra’ and build time ‘T’, for object manufac...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
AFRIGRAPH
2003
ACM
13 years 11 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...