Sciweavers

736 search results - page 92 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
WEA
2009
Springer
104views Algorithms» more  WEA 2009»
14 years 2 months ago
Univariate Algebraic Kernel and Application to Arrangements
We present a cgal-based univariate algebraic kernel, which provides certied real-root isolation of univariate polynomials with integer coecients and standard functionalities such...
Sylvain Lazard, Luis Mariano Peñaranda, Eli...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
14 years 2 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
14 years 1 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
ARITH
2005
IEEE
14 years 1 months ago
N-Bit Unsigned Division via N-Bit Multiply-Add
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
Arch D. Robison
EMO
2005
Springer
123views Optimization» more  EMO 2005»
14 years 1 months ago
Initial Population Construction for Convergence Improvement of MOEAs
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
Christian Haubelt, Jürgen Gamenik, Jürge...