10608 search results - page 23 / 2122 » Complexity of O'Hara's Algorithm |
ESA
2004
Springer
14 years 3 months ago
2004
Springer
JC
2008
13 years 9 months ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
VLSID
2007
IEEE
14 years 10 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
CEC
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
COLOGNETWENTE
2010
13 years 8 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...