285 search results - page 27 / 57 » New Ways to Construct Binary Search Trees |
155
click to vote
ISSRE
2002
IEEE
15 years 11 months ago
2002
IEEE
Software Fault Tree Analysis (SFTA) provides a structured way to reason about the safety or reliability of a software system. As such, SFTA is widely used in missioncritical appli...
171
click to vote
CCP
2011
14 years 6 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
154
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
163
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
149
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract-- In this paper we present a new version of a GPbased financial forecasting tool called EDDIE. The novelty of this new version (EDDIE 8), is its enlarged search space, whe...