21 search results - page 1 / 5 » Search Techniques for Rational Polynomial Orders |
AISC
2008
Springer
13 years 6 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
JACM
2007
13 years 4 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
AUTOMATICA
2008
13 years 4 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
SAT
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...
TSP
2008
13 years 4 months ago
2008
In this correspondence, parameter estimation of a polynomial phase signal (PPS) in additive white Gaussian noise is addressed. Assuming that the order of the PPS is at least 3, the...