A survey of randomness and parallelism in comparison problemsKRIZANC, D.Lecture notes in computer science. 1998, pp 324-329, issn 0302-9743, isbn 3-540-64359-1Conference Paper

A tight analysis of the greedy algorithm for set coverSLAVIK, P.Journal of algorithms (Print). 1997, Vol 25, Num 2, pp 237-254, issn 0196-6774Article

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

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

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

On the application of cohort-driven Operators to continuous optimization problems using evolutionary computationPATTON, A. L; DEXTER, T; GOODMAN, E. D et al.Lecture notes in computer science. 1998, pp 671-681, issn 0302-9743, isbn 3-540-64891-7Conference Paper

BubbleSearch : A simple heuristic for improving priority-based greedy algorithmsLESH, N; MITZENMACHER, M.Information processing letters. 2006, Vol 97, Num 4, pp 161-169, issn 0020-0190, 9 p.Article

On finding the convex hull of a simple polygonLEE, D. T.International journal of computer & information sciences. 1983, Vol 12, Num 2, pp 87-98, issn 0091-7036Article

Optimal search on some game treesTARSI, M.Journal of the Association for Computing Machinery. 1983, Vol 30, Num 3, pp 389-396, issn 0004-5411Article

Fast algorithms for the characteristic polynomialKELLER-GEHRIG, W.Theoretical computer science. 1985, Vol 36, Num 2-3, pp 309-317, issn 0304-3975Article

A parallel selection algorithmGUPTA, P; BHATTACHARJEE, G. P.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 3, pp 274-287, issn 0006-3835Article

New results on the k-Truck ProblemWEIMIN MA; YINFENG XU; YOU, Jane et al.Lecture notes in computer science. 2002, pp 504-513, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

A simple, efficient algorithm for maximum finding on ringsHIGHAM, L; PRZYTYCKA, T.Information processing letters. 1996, Vol 58, Num 6, pp 319-324, issn 0020-0190Article

A parallel algorithm for the monadic unification problemAUGER, I. E; KRISHNAMOORTHY, M. S.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 2, pp 302-306, issn 0006-3835Article

Portable randomized list ranking on multiprocessors using MPITRÄFF, J. L.Lecture notes in computer science. 1998, pp 395-402, issn 0302-9743, isbn 3-540-65041-5Conference Paper

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

Neural ARX models and PAC learningNAJARIAN, K; DUMONT, G. A; DAVIES, M. S et al.Lecture notes in computer science. 2000, pp 305-315, issn 0302-9743, isbn 3-540-67557-4Conference Paper

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

On the importance of having an identity or, is consensus really universal?BUHRMAN, Harry; PANCONESI, Alessandro; SILVESTRI, Riccardo et al.Lecture notes in computer science. 2000, pp 134-148, issn 0302-9743, isbn 3-540-41143-7Conference Paper

Output-sensitive algorithms for uniform partitions of pointsAGARWAL, P. K; BHATTACHARYA, B. K; SEN, S et al.Lecture notes in computer science. 1999, pp 403-414, issn 0302-9743, isbn 3-540-66916-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

Packet routing and information gathering in lines, rings and treesAZAR, Yossi; ZACHUT, Rafi.Lecture notes in computer science. 2005, pp 484-495, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper