15375 search results - page 216 / 3075 » cans 2008 |
CONCURRENCY
2008
13 years 7 months ago
2008
ce that allows navigation from an abstract model of the experiment to instance data collected during a specific experiment run. We outline modest extensions to a commercial workflo...
COR
2008
13 years 7 months ago
2008
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
DM
2008
13 years 7 months ago
2008
For two or more classes of points in Rd with d 1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect...
MICS
2007
13 years 7 months ago
2007
We describe an approach to the computation of symbolic resultants in which factors are removed during the course of the calculation, so reducing the stack size required for interme...
MICS
2007
13 years 7 months ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...