Sciweavers

3328 search results - page 3 / 666
» On Plateaued Functions and Their Constructions
Sort
View
CEC
2007
IEEE
14 years 1 months ago
Plateaus can be harder in multi-objective optimization
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
JCT
2006
87views more  JCT 2006»
13 years 7 months ago
Construction of bent functions via Niho power functions
A Boolean function with an even number n = 2k of variables is called bent if it is maximally nonlinear. We present here a new construction of bent functions. Boolean functions of ...
Hans Dobbertin, Gregor Leander, Anne Canteaut, Cla...
ICAI
2009
13 years 5 months ago
On the Construction of Initial Basis Function for Efficient Value Function Approximation
- We address the issues of improving the feature generation methods for the value-function approximation and the state space approximation. We focus the improvement of feature gene...
Chung-Cheng Chiu, Kuan-Ta Chen
ICML
2007
IEEE
14 years 8 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
TVCG
2012
184views Hardware» more  TVCG 2012»
11 years 10 months ago
Output-Sensitive Construction of Reeb Graphs
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
Harish Doraiswamy, Vijay Natarajan