4372 search results - page 243 / 875 » Algorithmic Theories of Everything |
154
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
140
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
140
click to vote
ICAISC
2004
Springer
15 years 11 months ago
2004
Springer
Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns ...
171
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
162
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...