Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Método arborescente")

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

Results 1 to 25 of 955

  • Page / 39

Selection :

  • and

The Prague dependency treebank : Crossing the sentence boundaryHAJICOVA, E.Lecture notes in computer science. 1999, Vol 1692, pp 20-27, issn 0302-9743, isbn 3-540-66494-7Conference Paper

Efficient tree-based revocation in groups of low-state devicesGOODRICH, Michael T; SUN, Jonathan Z; TAMASSIA, Roberto et al.Lecture notes in computer science. 2004, pp 511-527, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Des arbres à compresserLEHNING, Hervé.Recherche (Paris, 1970). 2007, Num 408, pp 82-83, issn 0029-5671, 2 p.Article

Automatic generation of answers using solution network for mathematical exercisesKOJIRI, Tomoko; HOSONO, Sachiyo; WATANABE, Toyohide et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28894-5, vol3, 1303-1309Conference Paper

Organisation des branchements pour la solution des problèmes d'unification par des algorithmes correcteursGOL'DENGORIN, B. I.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1986, Num 3, pp 167-169, issn 0002-3388Article

On identifying tree-structured perfect mapsBORGELT, Christian.Lecture notes in computer science. 2003, pp 385-395, issn 0302-9743, isbn 3-540-20059-2, 11 p.Conference Paper

Vainqueurs de Kemeny et tournois difficiles = Kemeny winners and hard tournamentsGUENOCHE, A.Mathématiques, informatique et sciences humaines. 1996, Num 133, pp 57-65, issn 0995-2314Article

Constrained tree inclusionVALIENTE, Gabriel.Lecture notes in computer science. 2003, pp 361-371, issn 0302-9743, isbn 3-540-40311-6, 11 p.Conference Paper

An approximation method for performance analysis of assembly/disassembly systems with parallel-machine stationsJEONG, K.-C; KIM, Y.-D.IIE transactions. 1999, Vol 31, Num 4, pp 391-394, issn 0740-817XArticle

An algorithm for single machine sequencing with release dates to minimize maximum costZDRZALKA, S; GRABOWSKI, J.Discrete applied mathematics. 1989, Vol 23, Num 1, pp 73-89, issn 0166-218XArticle

A multilevel parallel processing approach to scene labeling problemsHSI-HO LIU; YOUNG, T. Y; AMITAVA DAS et al.IEEE transactions on pattern analysis and machine intelligence. 1988, Vol 10, Num 4, pp 586-590, issn 0162-8828Article

A tree search methodology based on sequential dynamic programming and set analysisSHOAEI, M; LORENSEN, S. S; TEDDER, D. W et al.Computers & chemical engineering. 1987, Vol 11, Num 5, pp 469-480, issn 0098-1354Article

Heat exchanger network synthesis by a depth-first method―A case studyJEZOWSKI, J; HAHNE, E.Chemical engineering science. 1986, Vol 41, Num 12, pp 2989-2997, issn 0009-2509Article

Behavior description and control using behavior module for personal robotHOSHINO, Yukiko; TAKAGI, Tsuyoshi; DI PROFIO, Ugo et al.IEEE International Conference on Robotics and Automation. 2004, pp 4165-4171, isbn 0-7803-8232-3, 5Vol, 7 p.Conference Paper

Tree pattern relaxationAMER-YAHIA, Sihem; CHO, Sungran; SRIVASTAVA, Divesh et al.Lecture notes in computer science. 2002, pp 496-513, issn 0302-9743, isbn 3-540-43324-4Conference Paper

Minimally colored treesRINSMA, I; HENDY, M; PENNY, D et al.Mathematical biosciences. 1990, Vol 98, Num 2, pp 201-210, issn 0025-5564Article

Sur un problème spécial de programmation entièreALEKSEEV, A. G; KEZHAEV, V. A; SUBBOTIN, A. I et al.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1986, Num 4, pp 16-20, issn 0002-3388Article

Foundations of attack treesMAUW, Sjouke; OOSTDIJK, Martijn.Lecture notes in computer science. 2006, pp 186-198, issn 0302-9743, isbn 3-540-33354-1, 1Vol, 13 p.Conference Paper

Mining frequent closed itemsets without candidate generationKAI CHEN.Lecture notes in computer science. 2005, pp 668-677, issn 0302-9743, isbn 3-540-29769-3, 1Vol, 10 p.Conference Paper

Efficient incremental pattern mining from semi-structured datasetQI WANG; ENHONG CHEN; SHU WANG et al.Lecture notes in computer science. 2004, pp 211-216, issn 0302-9743, isbn 3-540-21371-6, 6 p.Conference Paper

Efficient similarity search in large databases of tree structured objectsKAILING, Karin; KRIEGEL, Hans-Peter; SCHÖNAUER, Stefan et al.International Conference on data engineering. 2004, isbn 0-7695-2065-0, 1Vol, p. 835Conference Paper

Reducing the integration of public administration databases to approximate tree matchinAUGSTEN, Nikolaus; BÖHLEN, Michael; GAMPER, Johann et al.Lecture notes in computer science. 2004, pp 102-107, issn 0302-9743, isbn 3-540-22916-7, 6 p.Conference Paper

Selective augmented Bayesian network classifiers based on rough set theoryZHIHAI WANG; WEBB, Geoffrey I; FEI ZHENG et al.Lecture notes in computer science. 2004, pp 319-328, issn 0302-9743, isbn 3-540-22064-X, 10 p.Conference Paper

Contribution à la Sécurité des Systèmes: Une Méthode d'Authentification Adaptative = A Contribution to System Security: A Continual Authentication MethodBascou, Jean-Jacques; Mercier, J.-J.1996, 147 p.Thesis

A new method for fuzzy fault tree analysisMISRA, K. B; WEBER, G. G.Microelectronics and reliability. 1989, Vol 29, Num 2, pp 195-216, issn 0026-2714, 22 p.Article

  • Page / 39