Sciweavers

986 search results - page 6 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
CC
2004
Springer
142views System Software» more  CC 2004»
14 years 1 months ago
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization
Abstract. Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limit...
Philippe Clauss, Irina Tchoupaeva
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
13 years 9 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
14 years 1 months ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
JCT
2010
112views more  JCT 2010»
13 years 6 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher
JUCS
2007
88views more  JUCS 2007»
13 years 7 months ago
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
Alkiviadis G. Akritas, Panagiotis S. Vigklas