2766 search results - page 130 / 554 » Algorithms for trigonometric polynomials |
140
Voted
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
127
click to vote
PKC
2004
Springer
15 years 9 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
182
click to vote
ARITH
2009
IEEE
15 years 8 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
159
click to vote
CPHYSICS
2011
14 years 7 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
114
click to vote
SAT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...