Sciweavers

166 search results - page 25 / 34
» Fixed-parameter evolutionary algorithms and the vertex cover...
Sort
View
IPCO
2007
108views Optimization» more  IPCO 2007»
14 years 11 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
WG
2004
Springer
15 years 2 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
91
Voted
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
15 years 3 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
14 years 7 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
EVOW
2005
Springer
15 years 3 months ago
Evolutionary Biclustering of Microarray Data
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
Jesús S. Aguilar-Ruiz, Federico Divina