Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Algorithm")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 251195

  • Page / 10048

Export

Selection :

  • and

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 representations of polymorphic types with subtypingAIKEN, A; WIMMERS, E. L; PALSBERG, J et al.Higher-order and symbolic computation. 1999, Vol 12, Num 3, pp 237-282, issn 1388-3690Article

A modified greedy heuristic for the Set Covering problem with improved worst case boundGOLDSCHMIDT, O; HOCHBAUM, D. S; GANG YU et al.Information processing letters. 1993, Vol 48, Num 6, pp 305-310, issn 0020-0190Article

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

The parallel odd-even merge algorithmYOUSIF, N. Y; EVVANS, D. J.International journal of computer mathematics. 1986, Vol 18, Num 3-4, pp 265-273, issn 0020-7160Article

Selecting problems for algorithm evaluationGOLDBERG, A. V.Lecture notes in computer science. 1999, pp 1-11, issn 0302-9743, isbn 3-540-66427-0Conference Paper

Analysis of a modified address calculation sorting algorithmSURAWEERA, F; AL-ANZY, J. M.Computer journal (Print). 1988, Vol 31, Num 6, pp 561-563, issn 0010-4620Article

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

A probabilistic algorithm for verifying matrix products using O(n2) time and log2n+O(1) random bitsKIMBREL, T; SINHA, K. R.Information processing letters. 1993, Vol 45, Num 2, pp 107-110, issn 0020-0190Article

A still better performance guarantee for approximate graph coloringHALLDORSSON, M. M.Information processing letters. 1993, Vol 45, Num 1, pp 19-23, issn 0020-0190Article

A fast radix sortDAVIS, I. J.Computer journal (Print). 1992, Vol 35, Num 6, pp 636-642, issn 0010-4620Article

Computation of Universal Objects for Distributions Over Co-TreesDENSINGPETERSEN, Henrik; TOPSØE, Flemming.IEEE transactions on information theory. 2012, Vol 58, Num 12, pp 7021-7035, issn 0018-9448, 15 p.Article

Minimal triangulations for graphs with few minimal separatorsBOUCHITTE, V; TODINCA, I.Lecture notes in computer science. 1998, pp 344-355, issn 0302-9743, isbn 3-540-64848-8Conference Paper

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

Global optimization of univariate Lipschitz functions. I: Survey and propertiesHANSEN, B; JAUMARD, B; SHI-HUI LU et al.Mathematical programming. 1992, Vol 55, Num 3, pp 251-272, issn 0025-5610Article

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

  • Page / 10048