4281 search results - page 106 / 857 » How to Disembed a Program |
105
click to vote
COMGEO
2007
ACM
15 years 2 months ago
2007
ACM
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has b...
114
Voted
CONCURRENCY
2007
15 years 2 months ago
2007
Runtime verification of multithreaded systems, that is, the process of finding errors in multithreaded systems as they execute, is the theme of this paper. The major goal of the...
131
click to vote
JFP
2008
15 years 2 months ago
2008
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
130
click to vote
CANDC
2005
ACM
15 years 2 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
120
click to vote
RC
2002
15 years 1 months ago
2002
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...