248 search results - page 6 / 50 » A Simple Optimal Randomized Algorithm for Sorting on the PDM |
CIAC
2010
Springer
13 years 11 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
CEC
2008
IEEE
13 years 9 months ago
2008
IEEE
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
ICRA
2002
IEEE
14 years 18 days ago
2002
IEEE
Effective image segmentation of a digitized scene into a set of recognizable objects requires the development of sophisticated scene analysis algorithms. Progress in this area has...
CCS
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
ICALP
2003
Springer
14 years 27 days ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...