6110 search results - page 451 / 1222 » Approximate Computing |
144
click to vote
ICRA
2006
IEEE
16 years 27 days ago
2006
IEEE
— Due to the abundant application background, the optimization of maintenance problem has been extensively studied in the past decades. Besides the well-known difficulty of larg...
206
click to vote
AMAI
2004
Springer
16 years 8 days ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
165
click to vote
ICTCS
2003
Springer
16 years 2 days ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
205
click to vote
ISVC
2009
Springer
15 years 11 months ago
2009
Springer
We present a new layered, hardware-accelerated splatting algorithm for volume rendering. Layered volume splatting features the speed benefits of fast axis-aligned pre-classified ...
205
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...