5316 search results - page 113 / 1064 » Which Search Problems Are Random |
117
click to vote
DEXA
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of data-stream classification, introducing a stream-classification algorithm, Dynamic Streaming Random Forests, that is able to handle evolving data streams...
144
click to vote
SPAA
1993
ACM
15 years 7 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
133
Voted
IJCAI
2007
15 years 4 months ago
2007
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the se...
128
click to vote
JCSS
2006
15 years 3 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
119
Voted
IPL
2010
15 years 1 months ago
2010
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...