5153 search results - page 173 / 1031 » Introduction to Randomized Algorithms |
123
click to vote
RECOMB
2006
Springer
16 years 3 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
177
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
124
click to vote
WAW
2009
Springer
15 years 9 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
123
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
112
click to vote
ESA
2004
Springer
15 years 8 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...