7421 search results - page 160 / 1485 » In search of dependable design |
180
click to vote
IBPRIA
2007
Springer
16 years 21 days ago
2007
Springer
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
147
click to vote
CG
2000
Springer
15 years 11 months ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
162
click to vote
UAI
1996
15 years 7 months ago
1996
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which ...
204
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
155
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...