Sciweavers

7519 search results - page 139 / 1504
» Optimizing Generic Functions
Sort
View
170
Voted
EVOW
2006
Springer
15 years 8 months ago
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
Olfa Sammoud, Sébastien Sorlin, Christine S...
STACS
2007
Springer
15 years 11 months ago
Pure Stationary Optimal Strategies in Markov Decision Processes
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. Performances of an MDP are evaluated by a payoff function. The controller of ...
Hugo Gimbert
205
Voted
JMLR
2010
121views more  JMLR 2010»
14 years 11 months ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor
GECCO
2009
Springer
164views Optimization» more  GECCO 2009»
15 years 2 months ago
Solving iterated functions using genetic programming
An iterated function f(x) is a function that when composed with itself, produces a given expression f(f(x))=g(x). Iterated functions are essential constructs in fractal theory and...
Michael D. Schmidt, Hod Lipson
GECCO
2010
Springer
217views Optimization» more  GECCO 2010»
15 years 7 months ago
Benchmarking CMA-EGS on the BBOB 2010 noiseless function testbed
This paper describes the implementation and the results for CMA-EGS on the BBOB 2010 noiseless function testbed. The CMA-EGS is a hybrid strategy which combines elements from grad...
Steffen Finck, Hans-Georg Beyer