Sciweavers

3422 search results - page 363 / 685
» Random Subset Optimization
Sort
View
FSTTCS
2004
Springer
15 years 9 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
GECCO
2003
Springer
109views Optimization» more  GECCO 2003»
15 years 9 months ago
Real Royal Road Functions for Constant Population Size
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
Tobias Storch, Ingo Wegener
ECAI
2010
Springer
15 years 5 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 5 months ago
Unsupervised learning of echo state networks: balancing the double pole
A possible alternative to fine topology tuning for Neural Network (NN) optimization is to use Echo State Networks (ESNs), recurrent NNs built upon a large reservoir of sparsely r...
Fei Jiang, Hugues Berry, Marc Schoenauer
TPDS
2008
88views more  TPDS 2008»
15 years 4 months ago
A Two-Hop Solution to Solving Topology Mismatch
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
Yunhao Liu