2403 search results - page 265 / 481 » Optimal Randomized RANSAC |
147
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
147
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
115
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
The behavior of natural, biological ecosystems is for a large part determined by environmental conditions. It should therefore be possible to experimentally manipulate such condit...
109
click to vote
IJCAI
2007
15 years 5 months ago
2007
Mechanism design is the study of preference aggregation protocols that work well in the face of self-interested agents. We present the first general-purpose techniques for automa...
119
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...