285 search results - page 26 / 57 » New Ways to Construct Binary Search Trees |
CG
2004
Springer
15 years 5 months ago
2004
Springer
In this paper a new method is described for move ordering, called the relative history heuristic. It is a combination of the history heuristic and the butterfly heuristic. Instead...
UAI
1997
15 years 1 months ago
1997
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
113
click to vote
CCGRID
2007
IEEE
15 years 6 months ago
2007
IEEE
The performance of MPI collective operations, such as broadcast and reduction, is heavily affected by network topologies, especially in grid environments. Many techniques to cons...
KDD
2001
ACM
16 years 4 days ago
2001
ACM
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
EMO
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...