Sciweavers

399 search results - page 72 / 80
» Using genetic algorithms to generate test plans for function...
Sort
View
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 6 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
EPS
1998
Springer
14 years 9 hour ago
Acquisition of General Adaptive Features by Evolution
We investigate the following question. Do populations of evolving agents adapt only to their recent environment or do general adaptive features appear over time? We find statistica...
Dan Ashlock, John E. Mayfield
JMLR
2010
103views more  JMLR 2010»
13 years 2 months ago
Learning Nonlinear Dynamic Models from Non-sequenced Data
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
Tzu-Kuo Huang, Le Song, Jeff Schneider
TEC
2008
135views more  TEC 2008»
13 years 7 months ago
Evolving Output Codes for Multiclass Problems
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
Nicolás García-Pedrajas, Colin Fyfe
CEC
2007
IEEE
14 years 2 months ago
Clonal particle swarm optimization and its applications
— Particle swarm optimization (PSO) is a stochastic global optimization algorithm inspired by social behavior of bird flocking in search for food, which is a simple but powerful...
Y. Tan, Z. M. Xiao