16404 search results - page 2671 / 3281 » A set coverage problem |
182
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
206
click to vote
DBPL
1993
Springer
15 years 11 months ago
1993
Springer
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
183
click to vote
DAC
1994
ACM
15 years 11 months ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
173
click to vote
ESA
1994
Springer
15 years 11 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
235
click to vote
ALP
1992
Springer
15 years 11 months ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....