2252 search results - page 256 / 451 » Improving Random Forests |
117
Voted
EUC
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we propose a hierarchical architecture for grouping peers into clusters in a large-scale BitTorrent-like underlying overlay network in such a way that clusters are e...
111
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
This paper presents a gregarious particle swarm optimization algorithm (G-PSO) in which the particles explore the search space by aggressively scouting the local minima with the h...
101
click to vote
ASPDAC
1995
ACM
15 years 4 months ago
1995
ACM
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and ...
IMA
1995
Springer
15 years 4 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
SIGIR
2010
ACM
15 years 4 months ago
2010
ACM
It has been observed that precision increases with collection size. One explanation could be that the redundancy of information increases, making it easier to find multiple docum...