Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Medida complexidad")

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 535

  • Page / 22

Selection :

  • and

DNA self-assembly for constructing 3D boxesKAO, Ming-Yang; RAMACHANDRAN, Vijay.Lecture notes in computer science. 2001, pp 429-440, issn 0302-9743, isbn 3-540-42985-9Conference Paper

Computational capabilities of multilayer committee machinesNEIROTTI, J. P; FRANCO, L.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 44, issn 1751-8113, 445103.1-445103.26Article

Mesure naturelle de la complexité des systèmes et de leur architecturePRINTZ, Jacques.Génie logiciel (1995). 2007, Num 82, pp 8-22, issn 1265-1397, 15 p.Article

Accounting for complexity in costing high technology manufacturingCOOPER, W. W; SINHA, K. K; SULLIVAN, R. S et al.European journal of operational research. 1995, Vol 85, Num 2, pp 316-326, issn 0377-2217Article

A study of the applicability of complexity measuresDAVIS, J. S; LEBLANC, R. J.IEEE transactions on software engineering. 1988, Vol 14, Num 9, pp 1366-1372, issn 0098-5589Article

Entropy measures of physics via complexityKANIADAKIS, Giorgio; TOPSØE, Flemming.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 41Conference Paper

Measures of complexity in wind directionCHANDA, A; DAS, J.Journal of Technical Physics. 2003, Vol 44, Num 2, pp 207-214, issn 0324-8313, 8 p.Article

Measuring software design complexityCARD, D. N; AGRESTI, W. W.The Journal of systems and software. 1988, Vol 8, Num 3, pp 185-197, issn 0164-1212Article

Wie gross ist die Aussagekraft heutiger Software-Metriken ? = How meaningful are today's software metrics?BAUMANN, P; RICHTER, L.Wirtschaftsinformatik. 1992, Vol 34, Num 6, pp 624-631, issn 0937-6429Article

Program complexity using hierarchical abstract computersBAIL, W. G; ZEIKOWITZ, M. V.Computer languages. 1988, Vol 13, Num 3-4, pp 109-123, issn 0096-0551Article

Modified Cognitive Complexity MeasureMISRA, Sanjay.Lecture notes in computer science. 2006, pp 1050-1059, issn 0302-9743, isbn 3-540-47242-8, 1Vol, 10 p.Conference Paper

Sensitive functions and approximate problemsCHAUDHURI, S.Information and computation (Print). 1996, Vol 126, Num 2, pp 161-168, issn 0890-5401Article

An experimental investigation of software metrics and their relationship to software development effortLIND, R. K; VAIRAVAN, K.IEEE transactions on software engineering. 1989, Vol 15, Num 5, pp 649-653, issn 0098-5589Article

A generalized statistical complexity measure: Applications to quantum systemsLOPEZ-RUIZ, R; NAGY, A; ROMERA, E et al.Journal of mathematical physics. 2009, Vol 50, Num 12, issn 0022-2488, 123528.1-123528.10Article

Sharpening Occam's razorMING LI; TROMP, John; VITANYI, Paul et al.Lecture notes in computer science. 2002, pp 411-419, issn 0302-9743, isbn 3-540-43996-X, 9 p.Conference Paper

Rank, trace-norm and max-normSREBRO, Nathan; SHRAIBMAN, Adi.Lecture notes in computer science. 2005, pp 545-560, issn 0302-9743, isbn 3-540-26556-2, 16 p.Conference Paper

The Tenjinno Machine Translation CompetitionSTARKIE, Bradford; VAN ZAANEN, Menno; ESTIVAL, Dominique et al.Lecture notes in computer science. 2006, pp 214-226, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 13 p.Conference Paper

Décompositions paradoxales des groupes de Burnside = Paradoxal decompositions of free Burnside groupsCECCHERINI-SILBERSTEIN, T; GRIGORCHUK, R; DE LA HARPE, P et al.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1998, Vol 327, Num 2, pp 127-132, issn 0764-4442Article

Evaluating and extending NPath as a software complexity measureMCCOLL, R. B; MCKIM, J. C.The Journal of systems and software. 1992, Vol 17, Num 3, pp 275-279, issn 0164-1212Article

The π measureNIKOLIK, B.IET software (Print). 2008, Vol 2, Num 5, pp 404-416, issn 1751-8806, 13 p.Article

A note on universal measures for weak implicit computational complexityBECKMANN, Arnold.Lecture notes in computer science. 2002, pp 53-67, issn 0302-9743, isbn 3-540-00010-0, 15 p.Conference Paper

A note on the Kolmogorov data complexity and nonuniform logical definitionsTYSZKIEWICZ, J.Information processing letters. 1997, Vol 64, Num 4, pp 187-195, issn 0020-0190Article

Histogram regression estimation using data-dependent partitionsNOBEL, A.Annals of statistics. 1996, Vol 24, Num 3, pp 1084-1105, issn 0090-5364Article

An efficient communication structure for distributed commit protocolsARIF GHAFOOR; BERRA, P. B.IEEE journal on selected areas in communications. 1989, Vol 7, Num 3, pp 375-389, issn 0733-8716Article

Jump interpolation search trees and symmetric binary numbersGUNTZER, U; PAUL, M.Information processing letters. 1987, Vol 26, Num 4, pp 193-204, issn 0020-0190Article

  • Page / 22