447 search results - page 40 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
160
Voted
COMPGEOM
1996
ACM
15 years 7 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
156
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
112
Voted
JCO
2006
15 years 3 months ago
2006
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
155
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
136
Voted
MOC
2000
15 years 3 months ago
2000
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...