3690 search results - page 680 / 738 » Computation with classical sequents |
IJRR
2002
14 years 9 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
82
Voted
JPDC
1998
14 years 9 months ago
1998
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
SIAMCOMP
1998
14 years 9 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
SMR
1998
14 years 9 months ago
1998
So-called little, or domain-specific languages (DSLs), have the potential to make software maintenance simpler: domain-experts can directly use the DSL to make required routine m...