6110 search results - page 332 / 1222 » Approximate Computing |
171
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
202
Voted
ICTCS
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
161
Voted
RANDOM
2001
Springer
15 years 11 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
177
click to vote
VC
2008
15 years 6 months ago
2008
Given a large set of unorganized point sample data, we propose a new framework for computing a triangular mesh representing an approximating piecewise smooth surface. The data may ...
166
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...