Sciweavers

137 search results - page 8 / 28
» On probabilistic analysis of randomization in hybrid symboli...
Sort
View
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
13 years 11 months ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
ECCV
2004
Springer
14 years 9 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
EC
2008
120views ECommerce» more  EC 2008»
13 years 7 months ago
Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants...
Shengxiang Yang
TPDS
2010
135views more  TPDS 2010»
13 years 6 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
POPL
2005
ACM
14 years 8 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula