Sciweavers

319 search results - page 15 / 64
» Robust Solutions in Unstable Optimization Problems
Sort
View
EVOW
2001
Springer
14 years 1 months ago
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
Ivana Ljubic, Günther R. Raidl
AIPS
2009
13 years 10 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 2 months ago
Niching in evolution strategies
Evolutionary Algorithms (EAs), popular search methods for solving search and optimization problems, are known for successful and fast location of single optimal solutions. However,...
Ofer M. Shir, Thomas Bäck
ICASSP
2008
IEEE
14 years 3 months ago
Generalized Improved Spread Spectrum watermarking robust against translation attacks
In this work, we consider the ISS (improved spread spectrum) watermarking [1] framework, and propose a generalized version of it, termed “Generalized Improved Spread Spectrum”...
Neslihan Gerek, Mehmet Kivanç Mihçak
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 2 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev