829 search results - page 77 / 166 » Bandit Algorithms for Tree Search |
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
100
click to vote
SAC
2006
ACM
15 years 3 months ago
2006
ACM
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
INFOSCALE
2007
ACM
14 years 11 months ago
2007
ACM
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...