Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ORDRE LEXICOGRAPHIQUE")

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 158

  • Page / 7
Export

Selection :

  • and

LEXICOGRAPHIC MATCHING IN BOOLEAN ALGEBRASAIGNER M.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 3; PP. 187-194; BIBL. 3 REF.Serial Issue

GENERATING TREES AND OTHER COMBINATORIAL OBJECTS LEXICOGRAPHICALLYZAKS S; RICHARDS D.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 1; PP. 73-81; BIBL. 16 REF.Article

ORDRE LEXICOGRAPHIQUE DES ARBRESVOLOSHINA AA.1977; DOKL. AKAD. NAUK B.S.S.R.; S.S.S.R.; DA. 1977; VOL. 21; NO 3; PP. 213-215; BIBL. 1 REF.Article

PROBLEME MULTICRITERE D'AFFECTATIONKHMEL'NIK SI.1977; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1977; NO 4; PP. 64-66; BIBL. 4 REF.Article

PRISE DE DECISIONS EN PRESENCE D'INCERTITUDE D'APRES DES CRITERES DE TYPE LEXICOGRAPHIQUEMORKELYUNAS A.1980; LITOV. MAT. SBOR.; SUN; DA. 1980; VOL. 20; NO 2; PP. 109-117; ABS. LIT/ENG; BIBL. 4 REF.Article

ALGORITHMS SUPPLEMENTWILSON JM.1983; COMPUTER JOURNAL; ISSN 0010-4620; GBR; DA. 1983; VOL. 26; NO 1; PP. 92; BIBL. 2 REF.Article

AN ALGORITHM TO DUALIZE A REGULAR SWITCHING FUNCTIONHAMMER PL; PELED UN; POLLATSCHEK MA et al.1979; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1979; VOL. 28; NO 3; PP. 238-243; BIBL. 9 REF.Article

ALGORITHME D'ORDONNANCEMENT LEXICOGRAPHIQUE DES ARBRESVOLOSHINA A.1977; VESCI AKAD. NAVUK B.S.S.R., FIZ.-MAT. NAVUK; S.S.S.R.; DA. 1977; NO 3; PP. 31-35; BIBL. 1 REF.Article

A DISCUSSION ON TWO ALGORITHMS FOR DETERMINING MAXIMUM COMPATIBLES.HANDOKO F.1975; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1975; VOL. 24; NO 8; PP. 838-840; BIBL. 2 REF.Article

LEXICOGRAPHIC GENERATION OF ORDERED TREESZAKS S.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 1; PP. 63-82; BIBL. 20 REF.Article

PROCEDURE ADAPTATIVE D'ESTIMATION DES ALTERNATIVES DE PREFERENCES PAR ORDRE LEXICOGRAPHIQUESAF'YAN AS.1977; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1977; NO 2; PP. 196-206; BIBL. 13 REF.Article

LESCICOGRAPHIC ORDERS, UTILITIES AND DECISION RULES: A SURVEY.FISHBURN PC.1974; MANAG. SCI.; U.S.A.; DA. 1974; VOL. 20; NO 11; PP. 1442-1471; BIBL. 4 P.Article

CRITERE DE MAXIMIN LEXICOGRAPHIQUE PROBABILISTEPODINOVSKIJ VV.1983; VESTNIK MOSKOVSKOGO UNIVERSITETA. SERIJA15: VYCISLITEL'NAJA MATEMATIKA I KIBERNETIKA; ISSN 509701; SUN; DA. 1983; NO 2; PP. 33-38; BIBL. 8 REF.Article

SUR LES CONDITIONS D'EXISTENCE DES SOLUTIONS DES PROBLEMES D'OPTIMISATION LEXICOGRAPHIQUECHERVAK YU YU.1982; IZVESTIJA AKEDEMII NAUK SSSR. TEHNICESKAJA KIBERNETIKA; ISSN 0002-3388; SUN; DA. 1982; NO 6; PP. 65-71; BIBL. 12 REF.Article

A note on combination generatorsGAN, C. T.ACM transactions on mathematical software. 1985, Vol 11, Num 2, pp 154-156, issn 0098-3500Article

Generation of permutations in direct lexicographic ordering by arithmetic methodsSPOLETINI, E.Computer journal (Print). 1985, Vol 28, Num 4, pp 444-445, issn 0010-4620Article

Permutation backtracking in lexicographic orderIRVING, R. W.Computer journal (Print). 1984, Vol 27, Num 4, pp 373-375, issn 0010-4620Article

Address calculation algorithms for ordered sets of combinationsNISHIHARA, S; IKEDA, K.Information processing letters. 1983, Vol 17, Num 5, pp 251-253, issn 0020-0190Article

General algorithms for the address calculation of lexicographically ordered tuplesKOTHARI, S. C; RAMARAO, K. V. S.Information processing letters. 1985, Vol 21, Num 3, pp 113-116, issn 0020-0190Article

OPTIMAL MULTI-WAY SEARCH TREESGOTLIEB L.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 422-433; BIBL. 7 REF.Article

Engineering a lightweight suffix array construction algorithm: (Extended abstract)MANZINI, Giovanni; FERRAGINA, Paolo.Lecture notes in computer science. 2002, pp 698-710, issn 0302-9743, isbn 3-540-44180-8, 13 p.Conference Paper

Lexicographic ordering, ranking and uranking of combinationsER, M. C.International journal of computer mathematics. 1985, Vol 17, Num 3, pp 277-283, issn 0020-7160Article

Representable P. Martin-Löf testsSTAIGER, L.Kybernetika. 1985, Vol 21, Num 3, pp 235-243, issn 0023-5954Article

GENERATION OF ALL THE BALANCED PARENTHESIS STRINGS IN LEXICOGRAPHICAL ORDERSEMBA I.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 188-192; BIBL. 2 REF.Article

Strightening codeterminantsWOODCOCK, D. J.Journal of pure and applied algebra. 1993, Vol 88, Num 1-3, pp 317-320, issn 0022-4049Article

  • Page / 7