Finding worst-case instances of, and lower bounds for, online algorithms using genetic algorithmsKOSORESOW, Andrew P; JOHNSON, Matthew P.Lecture notes in computer science. 2002, pp 344-355, issn 0302-9743, isbn 3-540-00197-2, 12 p.Conference Paper

Deriving global virtual time algorithms from conservative simulation protocolsVARGHESE, G; CHAMBERLAIN, R; WEIHL, W. E et al.Information processing letters. 1995, Vol 54, Num 2, pp 121-126, issn 0020-0190Article

On the analysis of the (1 + 1) evolutionary algorithmDROSTE, Stefan; JANSEN, Thomas; WEGENER, Ingo et al.Theoretical computer science. 2002, Vol 276, Num 1-2, pp 51-81, issn 0304-3975Article

ALT 2000 : algorithmic learning theory (Sydney, 11-13 December 2000)Arimura, Hiroki; Jain, Sanjay; Sharma, Arun et al.Lecture notes in computer science. 2000, issn 0302-9743, isbn 3-540-41237-9, XI, 333 p, isbn 3-540-41237-9Conference Proceedings

Rapid fine-tuning of computationally intensive classifiersZEMKE, S.Lecture notes in computer science. 2000, pp 294-302, issn 0302-9743, isbn 3-540-67354-7Conference Paper

Parameter-free Genetic Algorithm inspired by disparity theory of evolutionSAWAI, H; KIZU, S.Lecture notes in computer science. 1998, pp 702-711, issn 0302-9743, isbn 3-540-65078-4Conference Paper

PSA approach to population models for Parallel genetic algorithmsHARTMANN, P.Lecture notes in computer science. 1999, pp 60-67, issn 0302-9743, isbn 3-540-66363-0Conference Paper

Does data-model co-evolution improve generalization performance of evolving learners?SHAPIRO, J. L.Lecture notes in computer science. 1998, pp 540-549, issn 0302-9743, isbn 3-540-65078-4Conference Paper

Promoting generalisation of learned behaviours in genetic ProgrammingKUSCU, I.Lecture notes in computer science. 1998, pp 491-500, issn 0302-9743, isbn 3-540-65078-4Conference Paper

On the application of evolutionary pattern search algorithmsHART, W. E.Lecture notes in computer science. 1998, pp 303-312, issn 0302-9743, isbn 3-540-64891-7Conference Paper

L'impact des communications sur la complexité des algorithmes parallèles = The impact et communications on the complexity of parallel algorithmsBampis, Euripidis; König, Jean-Claude.1993, 127 p.Thesis

A comparative study of global and local selection in Evolution strategiesGORGES-SCHLEUTER, M.Lecture notes in computer science. 1998, pp 367-377, issn 0302-9743, isbn 3-540-65078-4Conference Paper

Continuous optimization using elite genetic algorithms with adaptive mutationsDJURISIC, A. B; RAKIC, A. D; LI, E. H et al.Lecture notes in computer science. 1999, pp 365-372, issn 0302-9743, isbn 3-540-65907-2Conference Paper

Strategies for searching with different access costsSANYLABER, E; MILIDIU, R. L; ALVES PESSOA, A et al.Lecture notes in computer science. 1999, pp 236-247, issn 0302-9743, isbn 3-540-66251-0Conference Paper

The effects of control parameters and restarts on search stagnation in evolutionary programmingMATHIAS, K. E; SCHAFFER, J. D; ESHELMAN, L. J et al.Lecture notes in computer science. 1998, pp 398-407, issn 0302-9743, isbn 3-540-65078-4Conference Paper

Adaptability and the usefulness of hintsBERMAN, P; GARAY, J. A.Lecture notes in computer science. 1998, pp 271-282, issn 0302-9743, isbn 3-540-64848-8Conference Paper

Random search versus genetic programming as engines for collective adaptationHAYNES, T.Lecture notes in computer science. 1998, pp 683-692, issn 0302-9743, isbn 3-540-64891-7Conference Paper

Scaling up evolutionary programming algorithmsXIN YAO; YONG LIU.Lecture notes in computer science. 1998, pp 103-112, issn 0302-9743, isbn 3-540-64891-7Conference Paper

Fast evolutionary learning with batch-type self-organizing mapsKOHONEN, T.Neural processing letters. 1999, Vol 9, Num 2, pp 153-162, issn 1370-4621Article

Adaptation under changing environments with various rates of inheritance of acquired characters : Comparison between Darwinian and Lamarckian evolutionSASAKI, T; TOKORO, M.Lecture notes in computer science. 1999, pp 34-41, issn 0302-9743, isbn 3-540-65907-2Conference Paper

On the informational asymmetry between upper and lower bounds for ultrametric evolutionary treesTING CHEN; KAO, M.-Y.Lecture notes in computer science. 1999, pp 248-256, issn 0302-9743, isbn 3-540-66251-0Conference Paper

EP98 : evolutionary programming VII (San Diego CA, 25-27 March 1998)Porto, V.W; Saravanan, N; Waagen, D et al.Lecture notes in computer science. 1998, issn 0302-9743, isbn 3-540-64891-7, XVI, 840 p, isbn 3-540-64891-7Conference Proceedings

Selective crossover in genetic algorithms : An empirical studyVEKARIA, K; CLACK, C.Lecture notes in computer science. 1998, pp 438-447, issn 0302-9743, isbn 3-540-65078-4Conference Paper

Local selectionMENCZER, F; BELEW, R. K.Lecture notes in computer science. 1998, pp 703-712, issn 0302-9743, isbn 3-540-64891-7Conference Paper

Short notes on the schema theorem and the building block hypothesis in genetic algorithmsSALOMON, R.Lecture notes in computer science. 1998, pp 113-122, issn 0302-9743, isbn 3-540-64891-7Conference Paper