2725 search results - page 239 / 545 » Constraint Solving for Interpolation |
214
click to vote
CORR
2002
Springer
15 years 7 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
211
click to vote
ACSD
2010
IEEE
15 years 5 months ago
2010
IEEE
We extend the partial order reduction algorithm of Clarke et al. [CJM00] to handle branching security protocols, such as optimistic fair exchange protocols. Applications of the pro...
209
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
212
click to vote
SIGGRAPH
1992
ACM
15 years 11 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
168
click to vote
IJCGA
2000
15 years 7 months ago
2000
Quadrilateral meshing algorithms impose certain constraints on the number of intervals or mesh edges of the curves bounding a surface. When constructing a conformal mesh of a colle...