5153 search results - page 286 / 1031 » Introduction to Randomized Algorithms |
131
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called “Royal Roads” functions, which should be id...
143
Voted
STACS
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
121
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
112
click to vote
SIGACT
2010
15 years 2 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
138
click to vote
SMA
2010
ACM
15 years 4 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...