2168 search results - page 13 / 434 » Randomized Algorithms and Complexity Theory |
81
Voted
STOC
1998
ACM
15 years 7 months ago
1998
ACM
132
Voted
CCA
2009
Springer
15 years 9 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
125
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
124
Voted
ILP
2004
Springer
15 years 8 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
89
Voted
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer