Sciweavers

3422 search results - page 102 / 685
» Random Subset Optimization
Sort
View
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
15 years 10 months ago
Modeling Coevolutionary Genetic Algorithms on Two-Bit Landscapes: Random Partnering
Abstract. A model of coevolutioinary genetic algorithms (COGA) consisting of two populations coevolving on two-bit landscapes is investigated in terms of the effects of random par...
Ming Chang, Kazuhiro Ohkura, Kanji Ueda, Masaharu ...
IPPS
1997
IEEE
15 years 8 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
ISCI
2008
102views more  ISCI 2008»
15 years 4 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
TCS
2010
15 years 2 months ago
Randomized priority algorithms
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
Spyros Angelopoulos, Allan Borodin
MOBIHOC
2009
ACM
16 years 5 months ago
Energy-efficient capture of stochastic events by global- and local-periodic network coverage
We consider a high density of sensors randomly placed in a geographical area for event monitoring. The monitoring regions of the sensors may have significant overlap, and a subset...
Shibo He, Jiming Chen, David K. Y. Yau, Huanyu Sha...