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

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

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 explorative power of ES/EP-like algorithmsBEYER, H.-G.Lecture notes in computer science. 1998, pp 323-334, 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

A variant of the arrow distributed directory with low average complexityPELEG, D; RESHEF, E.Lecture notes in computer science. 1999, pp 615-624, issn 0302-9743, isbn 3-540-66224-3Conference Paper

Randomized weighted caching with two page weightsIRANI, S.Algorithmica. 2002, Vol 32, Num 4, pp 624-640, issn 0178-4617Article

Parallel graph algorithmsQUINN, M. J; NARSINGH DEO.ACM computing surveys. 1984, Vol 16, Num 3, pp 319-348, issn 0360-0300Article

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

A processor efficient MIS algorithm on random graphsYANG, S. B; DHALL, S. K; LAKSHMIVARAHAN, S et al.Information processing letters. 1994, Vol 49, Num 3, pp 157-163, issn 0020-0190Article

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

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

Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebraDEMEL, J; DEMLOVA, M; KOUBEK, V et al.Theoretical computer science. 1985, Vol 36, Num 2-3, pp 203-216, issn 0304-3975Article

Partitioning with two lines in the planeMEGIDDO, N.Journal of algorithms (Print). 1985, Vol 6, Num 3, pp 430-433, issn 0196-6774Article

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