1611 search results - page 170 / 323 » A Library for Self-Adjusting Computation |
189
click to vote
IJCAI
1993
15 years 7 months ago
1993
Anytime algorithms, whose quality of results improves gradually as computation time increases, provide useful performance components for timecritical planning and control of robot...
140
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
166
click to vote
CAV
2010
Springer
15 years 6 months ago
2010
Springer
We define and study a new abstract domain which is a fine-grained combination of zonotopes with (sub-)polyhedric domains such as the interval, ocinear template or polyhedron domain...
167
click to vote
HPCC
2010
Springer
15 years 6 months ago
2010
Springer
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
163
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...