Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("COMPUTING")

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 273016

  • Page / 10921
Export

Selection :

  • and

Delocalisation informatique ou fonction client/serveur : réflexion d'un praticienCAPDASPE COUCHET, R.1994, 9 p.Book

L'environnement client/serveur et la participation des utilisateursPARENT, R; BOUCHARD, L; AUBERT, B et al.1995, 43 p.Book

A study of user participation in systems development = Etude sur la participation de l'utilisateur au développement de systèmes d'informationBOUCHARD, L; PARENT, R; AUBERT, B et al.1996, 17 p.Book

Le rôle des SSII dans l'intégration des outils informatiques et des TIC au sein des PMECHAMARD, C; BESSAGNET, M. N; SALLABERRY, C et al.Journées Nationales des IAE. 2002, 12 p.Conference Paper

Quelques réflexions sur les besoins d'informationMONNOT DES ANGLES, L.Les Cahiers Lyonnais de Recherche en Gestion. 1995, Num 16, pp 472-487Article

A COMBINATORIAL APPROACH TO POLYGON SIMILARITYAVIS D; ELGINDY H.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 148-150; BIBL. 15 REF.Article

LOWER BOUNDS OF THE COMPLEXITY OF LINEAR ALGEBRASBINI D; CAPOVANI M.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 46-47; BIBL. 3 REF.Article

PARTITION OPTIMALE D'UN ENSEMBLE FINI EN SOUS-ENSEMBLESTANAEV VS.1979; DOKL. AKAD. NAUK B.S.S.R.; BYS; DA. 1979; VOL. 23; NO 1; PP. 26-28; ABS. ENG; BIBL. 4 REF.Article

A NOTE ON LOCATING A SET OF POINTS IN A PLANAR SUBDIVISIONPREPARATA FP.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 542-545; BIBL. 4 REF.Article

AN ANALYSIS OF GENERALIZATION AS A SEARCH PROBLEMMITCHELL TM.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 1; PP. 577-582; BIBL. 13 REF.Conference Paper

ALGEBRAS HAVING LINEAR MULTIPLICATIVE COMPLEXITIES.FIDUCCIA CM; ZALCSTEIN Y.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 2; PP. 311-331; BIBL. 28 REF.Article

POCKET CALCULATOR PROGRAM FOR THE ONE-SHOT METHOD OF TREE HEIGHT MEASUREMENT ON PERMANENT PLOTSNEAL RL JR.1981; FOR. SCI.; ISSN 0015-749X; USA; DA. 1981; VOL. 27; NO 4; PP. 815-816Article

DYNAMIZATION OF DECOMPOSABLE SEARCHING PROBLEMSVAN LEEUWEN J; WOOD D.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 2; PP. 51-56; BIBL. 6 REF.Article

NEGATION CAN BE EXPONENTIALLY POWERFULVALIANT LG.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 303-314; BIBL. 23 REF.Article

THE COMPUTATIONAL COMPLEXITY OF MATROID PROPERTIESROBINSON GC; WELSH DJA.1980; MATH. PROC. CAMBRIDGE PHILOS. SOC.; GBR; DA. 1980; VOL. 87; NO 1; PP. 29-45; BIBL. 17 REF.Article

COMPUTER-GRAPHICS ANALYSIS OF ATMOSPHERIC REFRACTION.LEHN WH; EL ARINI MB.1978; APPL. OPT.; USA; DA. 1978; VOL. 17; NO 19; PP. 3146-3151; BIBL. 6 REF.Article

PACKINGS OF GRAPHS AND APPLICATIONS TO COMPUTATIONAL COMPLEXITYBOLLOBAS B; ELDRIDGE SE.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 2; PP. 105-124; BIBL. 9 REF.Article

METHODE RAPIDE DE CALCUL PAR ORDINATEUR DU CHAMP GRAVITATIONNEL DES MASSES TRIDIMENSIONNELLESGOLIZDRA G YA.1976; IZVEST. AKAD. NAUK S.S.S.R., FIZ. ZEMLI; S.S.S.R.; DA. 1976; NO 11; PP. 61-67; BIBL. 18 REF.Article

1996 software best practice survey : analysis of result = Etude 1996 des meilleures pratiques en matière d'informatique : analyse des résultatsKULANDAISWAMY, S; DUTTA, S; VAN WASSENHOVE, L et al.1997, 18 p.Book

COMPUTATIONAL LENGTH IN PATTERN RECOGNIZERSVISCOLANI B.1982; PATTERN RECOGNITION; ISSN 0031-3203; USA; DA. 1982; VOL. 15; NO 5; PP. 413-418; BIBL. 6 REF.Article

THE COMPUTATIONAL COMPLEXITY OF A SET OF QUADRATIC FUNCTIONSJA'JA' J.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 209-223; BIBL. 13 REF.Article

A FAST ALGORITHM FOR NONPARAMETRIC PROBABILITY DENSITY ESTIMATIONPOSTAIRE JG; VASSEUR C.1982; IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 6; PP. 663-666; BIBL. 9 REF.Article

PROVABLY DIFFICULT COMBINATORIAL GAMESSTOCKMEYER LJ; CHANDRA AK.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 2; PP. 151-174; BIBL. 24 REF.Article

A NOTE ON THE COMPLEXITY OF ALGEBRAIC DIFFERENTIATION.CAVINESS BF; EPSTEIN HI.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 2; PP. 122-124; BIBL. 6 REF.Article

ON GENERALIZED COMPUTATIONAL COMPLEXITY.JACOBS BE.1977; J. SYMBOL. LOGIC; U.S.A.; DA. 1977; VOL. 42; NO 1; PP. 47-58; BIBL. 23 REF.Article

  • Page / 10921