4198 search results - page 286 / 840 » In search of lost time |
210
click to vote
WEA
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
192
click to vote
SIAMDM
2010
15 years 1 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
146
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
168
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The (1+1)-ES with one-fifth success rule is one of the first and simplest stochastic algorithm proposed for optimization on a continuous search space in a black-box scenario. In...
178
click to vote
TREC
2004
15 years 8 months ago
2004
This is the first year that the Dalhousie University participated in TREC. We submitted three runs for the QA track. Our evaluation results are generally below the median (with on...