Sciweavers

664 search results - page 43 / 133
» Some results for a class of generalized polynomials
Sort
View
CAV
2006
Springer
90views Hardware» more  CAV 2006»
15 years 1 months ago
Termination of Integer Linear Programs
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integ...
Mark Braverman
ICDCS
2002
IEEE
15 years 2 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir
CP
2011
Springer
13 years 9 months ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny
WG
2000
Springer
15 years 1 months ago
Networks with Small Stretch Number
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
Serafino Cicerone, Gabriele Di Stefano
SAC
2006
ACM
15 years 3 months ago
Improving the compensated Horner scheme with a fused multiply and add
Several different techniques and softwares intend to improve the accuracy of results computed in a fixed finite precision. Here we focus on a method to improve the accuracy of ...
Stef Graillat, Philippe Langlois, Nicolas Louvet