7228 search results - page 319 / 1446 » From Algorithmic to Subjective Randomness |
173
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
134
click to vote
GLOBECOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
141
click to vote
ESANN
2006
15 years 6 months ago
2006
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. In previous work we combine random selection under-sampling with th...
134
click to vote
EMO
2005
Springer
15 years 10 months ago
2005
Springer
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
158
Voted
WEA
2004
Springer
15 years 10 months ago
2004
Springer
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...