2107 search results - page 57 / 422 » Computing Small Search Numbers in Linear Time |
125
Voted
GD
2006
Springer
15 years 6 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
114
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
108
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
In dynamically multithreaded platforms that employ work stealing, there appears to be a fundamental tradeoff between providing provably good time and space bounds and supporting S...
138
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
106
Voted
SEMWEB
2009
Springer
15 years 9 months ago
2009
Springer
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...