8298 search results - page 1315 / 1660 » On the Complexity of Numerical Analysis |
181
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
149
click to vote
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
171
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
170
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
181
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...