440 search results - page 9 / 88 » Comparison of Galled Trees |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...
ACMICEC
2003
ACM
14 years 2 months ago
2003
ACM
We develop two algorithms to manage bid data in flexible, multi-unit double auctions. The first algorithm is a multi-unit extension of the 4-HEAP algorithm, and the second is a ...
CG
2002
Springer
13 years 8 months ago
2002
Springer
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
ESEM
2007
ACM
13 years 10 months ago
2007
ACM
Can we predict locations of future refactoring based on the development history? In an empirical study of open source projects we found that attributes of software evolution data ...