1204 search results - page 66 / 241 » Termination of Polynomial Programs |
130
click to vote
CAV
2008
Springer
15 years 2 months ago
2008
Springer
Termination of a heap-manipulating program generally depends on preconditions that express heap assumptions (i.e., assertions describing reachability, aliasing, separation and shar...
101
Voted
SAC
2006
ACM
15 years 6 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
133
Voted
TRIER
2002
15 years 7 days ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
99
Voted
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
The problem under study here is the minimax design of linearphase lowpass FIR filters having variable passband width and implemented through a Farrow structure. We have two main ...
96
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...