Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Algorithme optimal")


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


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

Author Country

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


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

Results 1 to 25 of 4954

  • Page / 199

Selection :

  • and

Can a student learn optimally from two different teachers?NEIROTTI, J. P.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 1, issn 1751-8113, 015101.1-015101.16Article

A new linear convex hull algorithm for simple polygonsBHATTACHARYA, B. K; ELGINDY, H.IEEE transactions on information theory. 1984, Vol 30, Num 1, pp 85-88, issn 0018-9448Article

Orthogonal projections are optimal algorithmsMICCHELLI, C. A.Journal of approximation theory. 1984, Vol 40, Num 2, pp 101-110, issn 0021-9045Article

Parallel strategy for optimal learning in perceptronsNEIROTTI, J. P.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 12, issn 1751-8113, 125101.1-125101.15Article

Average case optimality for linear problemsTRAUB, J. F; WASILKOWSKI, G. W; WOZNIAKOWSKI, H et al.Theoretical computer science. 1984, Vol 29, Num 1-2, pp 1-25, issn 0304-3975Article

Optimal algoriths for the intersection and the minimum distance problems between planar polygonsCHIN, F; CAO AN WANG.IEEE transactions on computers. 1983, Vol 32, Num 12, pp 1203-1207, issn 0018-9340Article

Measuring uncertainty without a normWERSCHULZ, A. G.Aequationes mathematicae (Printed ed.). 1983, Vol 26, Num 1, pp 74-82, issn 0001-9054Article

A note on the power of integer divisionVYSKOC, J.Information processing letters. 1983, Vol 17, Num 2, pp 71-72, issn 0020-0190Article

Optimal polygon placement by translationSUDEBKUMAR PRASANT PAL; BHASKAR DASGUPTA; VENI MADHAVAN, C. E et al.International journal of computer mathematics. 1994, Vol 52, Num 3-4, pp 139-148, issn 0020-7160Article

An optimal algorithm for computing a minimum nested nonconvex polygonSUBIR KUMAR GHOSH; ANIL MAHESHWARI.Information processing letters. 1990, Vol 36, Num 6, pp 277-280, issn 0020-0190, 4 p.Article

Optimal constructions of hybrid algorithmsKAO, M.-Y; YUAN MA; SIPSER, M et al.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 142-164, issn 0196-6774Article

Parametric computation of margins and of minimum cumulative register lifetime datesDUPONT DE DINECHIN, B.Lecture notes in computer science. 1997, pp 231-245, issn 0302-9743, isbn 3-540-63091-0Conference Paper

TWOPRIME : A fast stream ciphering algorithmDING, C; NIEMI, V; RENVALL, A et al.Lecture notes in computer science. 1997, pp 88-102, issn 0302-9743, isbn 3-540-63247-6Conference Paper

A correction to 'an optimal algorithm to compute all the covers of a string'MOORE, D; SMYTH, W. F.Information processing letters. 1995, Vol 54, Num 2, pp 101-103, issn 0020-0190Article

An algorithm for L-shaped channel routing in a diagonal modelXIAOYU SONG.IEEE transactions on computer-aided design of integrated circuits and systems. 1992, Vol 11, Num 2, pp 267-270, issn 0278-0070Article

Algorithmes optimaux de résolution des problèmes de configuration et de recouvrement des figures polygonales planesNOSOV, L. V; NOSOVA, E. G; RABINOVICH, E. B et al.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1985, Num 4, pp 28-36, issn 0002-3574Article

Minimum vertex distance between separable convex polygonsCHIN, F; WANG, C. A.Information processing letters. 1984, Vol 18, Num 1, pp 41-45, issn 0020-0190Article

An algorithm for edge-coloring of multigraphsNISHIZEKI, T; SATO, M.Systems, computers, controls. 1984, Vol 15, Num 4, pp 58-63, issn 0096-8765Article

Finding rectangle intersections by divide-and-conquerGÜTING, R. H; WOOD, D.IEEE transactions on computers. 1984, Vol 33, Num 7, pp 671-675, issn 0018-9340Article

Adjudicating a towers of Hanoi contestWOOD, D.International journal of computer mathematics. 1983, Vol 14, Num 3-4, pp 199-207, issn 0020-7160Article

Algorithms for optimal protein structure alignmentPOLEKSIC, Aleksandar.Bioinformatics (Oxford. Print). 2009, Vol 25, Num 21, pp 2751-2756, issn 1367-4803, 6 p.Article

A Note on Trees, Tables, and AlgorithmsGODDARD, Wayne; HEDETNIEMI, Stephen T.Networks (New York, NY). 2009, Vol 53, Num 2, pp 184-190, issn 0028-3045, 7 p.Article

Sorting on a massively parallel system using a library of basic primitives : Modeling and experimental resultsWACHSMANN, A; WANKA, R.Lecture notes in computer science. 1997, pp 399-408, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Randomness in distribution protocolsBLUNDO, C; DE SANTIS, A; VACCARO, U et al.Information and computation (Print). 1996, Vol 131, Num 2, pp 111-139, issn 0890-5401Article

International symposium on optimal algorithms: [selected papers], Varna, Bulgaria, May 29-June 2, 1989DJIDJEV, Hristo N.Lecture notes in computer science. 1989, Vol 401, issn 0302-9743, VI-308 p. [314 p.]Conference Proceedings

  • Page / 199