Sciweavers

86 search results - page 1 / 18
» A New Approach to Estimating the Expected First Hitting Time...
Sort
View
AAAI
2006
13 years 6 months ago
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
Yang Yu, Zhi-Hua Zhou
CEC
2008
IEEE
13 years 11 months ago
New evaluation criteria for the convergence of continuous evolutionary algorithms
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...
Ying Lin, Jian Huang, Jun Zhang
ICCAD
1996
IEEE
151views Hardware» more  ICCAD 1996»
13 years 9 months ago
Expected current distributions for CMOS circuits
The analysis of CMOS VLSI circuit switching current has become an increasingly important and difficult task from both a VLSI design and simulation software perspective. This paper...
Dennis J. Ciplickas, Ronald A. Rohrer
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
13 years 9 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
WSC
2007
13 years 7 months ago
New greedy myopic and existing asymptotic sequential selection procedures: preliminary empirical results
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
Stephen E. Chick, Jürgen Branke, Christian Sc...