Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Análisis algoritmo")

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

Results 1 to 25 of 5875

  • Page / 235

Export

Selection :

  • and

A novel algorithm for analysis of surface plasmon polaritons in metallic thin filmsTRAMPEL, C; KOBIDZE, G; SHANKER, B et al.IEEE antennas and propagation society international symposiumNational radio science meeting. 2004, pp 3159-3162, isbn 0-7803-8302-8, 4Vol, 4 p.Conference Paper

A discussion of a report by Ehud ShapiroBANERJI, R. B.Computational intelligence. 1987, Vol 3, Num 4, pp 295-303, issn 0824-7935Article

A note on binomial recurrences arising in the analysis of algorithmsPRODINGER, H; SZPANKOWSKI, W.Information processing letters. 1993, Vol 46, Num 6, pp 309-311, issn 0020-0190Article

Analysis of Euclidean algorithms for polynomials over finite fieldsKEJU MA; VON ZUR GATHEN, J.Journal of symbolic computation. 1990, Vol 9, Num 4, pp 429-455, issn 0747-7171, 27 p.Article

Automatic extraction of approximate repetitions in polyphonic midi files based on perceptive criteriaMEUDIC, Benoit; ST-JAMES, Emmanuel.Lecture notes in computer science. 2004, pp 124-142, issn 0302-9743, isbn 3-540-20922-0, 19 p.Conference Paper

The convergence span of greedy load balancingCOHEN, E.Information processing letters. 1994, Vol 52, Num 4, pp 181-182, issn 0020-0190Article

Approximating the tree and tour covers of a graphARKIN, E. M; HALLDORSSON, M. M; HASSIN, R et al.Information processing letters. 1993, Vol 47, Num 6, pp 275-282, issn 0020-0190Article

Smoothness and factoring polynomials over finite fieldsSHOUP, V.Information processing letters. 1991, Vol 38, Num 1, pp 39-42, issn 0020-0190Article

A new color change to improve the coloring of a graphBERGE, C.Discrete applied mathematics. 1989, Vol 24, Num 1-3, pp 25-28, issn 0166-218XArticle

An algorithm for determining the simplicity of a modular group representationMICHLER, G. O.Journal of symbolic computation. 1988, Vol 6, Num 1, pp 105-111, issn 0747-7171Article

The word problem for free partially commutative groupsWRATHALL, C.Journal of symbolic computation. 1988, Vol 6, Num 1, pp 99-104, issn 0747-7171Article

Exact balancing is not always goodSNIR, M.Information processing letters. 1986, Vol 22, Num 2, pp 97-102, issn 0020-0190Article

Approximate counting : a martingale approachROSENKRANTZ, Walter A.Rapport de recherche I.N.R.I.A, ISSN: 0249-6399 ; 508. 1986, 1 p.Report

Whole execution tracesXIANGYU ZHANG; GUPTA, Rajiv.IEEE/ACM international symposium on microarchitecture. 2004, pp 105-116, isbn 0-7695-2126-6, 1Vol, 12 p.Conference Paper

Fixed-parameter tractability of graph modification problems for hereditary propertiesCAI, L.Information processing letters. 1996, Vol 58, Num 4, pp 171-176, issn 0020-0190Article

A variational method for analysing unit clause searchMEJEAN, H.-M; MOREL, H; REYNAUD, G et al.SIAM journal on computing (Print). 1995, Vol 24, Num 3, pp 621-649, issn 0097-5397Article

Batch scheduling to minimize total completion timeGHOSH, J. B.Operations research letters. 1994, Vol 16, Num 5, pp 271-275, issn 0167-6377Article

Kaikoura tree theorems: computing the maximum agreement subtreeSTEEL, M; WARNOW, T.Information processing letters. 1993, Vol 48, Num 2, pp 77-82, issn 0020-0190Article

Analysis of a greedy heuristic for finding small dominating sets in graphsPAREKH, A. K.Information processing letters. 1991, Vol 39, Num 5, pp 237-240, issn 0020-0190Article

On recognisable properties of associative algebrasGATEVA-IVANOVA, T; LATYSHEV, V.Journal of symbolic computation. 1988, Vol 6, Num 2-3, pp 371-388, issn 0747-7171Article

Experimental AlgorithmsBATTITI, R; BERTOSSI, A.Algorithmica. 2002, Vol 33, Num 1, issn 0178-4617, 128 p.Serial Issue

Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searchesLUCAS CHI KWONG HUI; MARTEL, C. U.Information processing letters. 1996, Vol 58, Num 5, pp 231-236, issn 0020-0190Article

Perfect power testingBALASUBRAMANIAN, R; NAGARAJ, S. V.Information processing letters. 1996, Vol 58, Num 2, pp 59-63, issn 0020-0190Article

A note on the size of a multicast tree in hypercubesFUJITA, S.Information processing letters. 1995, Vol 54, Num 4, pp 223-227, issn 0020-0190Article

Two-dimensional pattern matching by samplingCROCHEMORE, M; GASIENIEC, L; RYTTER, W et al.Information processing letters. 1993, Vol 46, Num 4, pp 159-162, issn 0020-0190Article

  • Page / 235