Literatura científica selecionada sobre o tema "Enumeraton"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Enumeraton".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Enumeraton"
Beigel, Richard, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan e Leen Torenvliet. "Enumerations of the Kolmogorov function". Journal of Symbolic Logic 71, n.º 2 (junho de 2006): 501–28. http://dx.doi.org/10.2178/jsl/1146620156.
Texto completo da fonteShahrivari, Saeed, e Saeed Jalili. "Fast Parallel All-Subgraph Enumeration Using Multicore Machines". Scientific Programming 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/901321.
Texto completo da fonteSanei-Mehri, Seyed-Vahid, Apurba Das, Hooman Hashemi e Srikanta Tirthapura. "Mining Largest Maximal Quasi-Cliques". ACM Transactions on Knowledge Discovery from Data 15, n.º 5 (26 de junho de 2021): 1–21. http://dx.doi.org/10.1145/3446637.
Texto completo da fontePreviti, Alessandro, e Joao Marques-Silva. "Partial MUS Enumeration". Proceedings of the AAAI Conference on Artificial Intelligence 27, n.º 1 (30 de junho de 2013): 818–25. http://dx.doi.org/10.1609/aaai.v27i1.8657.
Texto completo da fontevan der Rest, Cas, e Wouter Swierstra. "A completely unique account of enumeration". Proceedings of the ACM on Programming Languages 6, ICFP (29 de agosto de 2022): 411–37. http://dx.doi.org/10.1145/3547636.
Texto completo da fonteCallan, David, e Toufik Mansour. "On permutations avoiding 1324, 2143, and another 4-letter pattern". Pure Mathematics and Applications 26, n.º 1 (27 de junho de 2017): 1–10. http://dx.doi.org/10.1515/puma-2015-0018.
Texto completo da fonteCallan, David, e Toufik Mansour. "On permutations avoiding 1243, 2134, and another 4-letter pattern". Pure Mathematics and Applications 26, n.º 1 (27 de junho de 2017): 11–21. http://dx.doi.org/10.1515/puma-2015-0019.
Texto completo da fonteIMAI, HIROSHI, TOMONARI MASADA, FUMIHIKO TAKEUCHI e KEIKO IMAI. "ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS". International Journal of Computational Geometry & Applications 12, n.º 06 (dezembro de 2002): 455–80. http://dx.doi.org/10.1142/s0218195902000980.
Texto completo da fonteWatson, Derrick G., Elizabeth A. Maylor e Lucy A. M. Bruce. "Effects of Age on Searching for and Enumerating Targets that Cannot be Detected Efficiently". Quarterly Journal of Experimental Psychology Section A 58, n.º 6 (agosto de 2005): 1119–42. http://dx.doi.org/10.1080/02724980443000511.
Texto completo da fonteCHUNG, K. S., C. N. KIM e K. NAMGOONG. "Evaluation of the Petrifilm Rapid Coliform Count Plate Method for Coliform Enumeration from Surimi-Based Imitation Crab Slurry". Journal of Food Protection 63, n.º 1 (1 de janeiro de 2000): 123–25. http://dx.doi.org/10.4315/0362-028x-63.1.123.
Texto completo da fonteTeses / dissertações sobre o assunto "Enumeraton"
Blackburn, Simon R. "Group enumeration". Thesis, University of Oxford, 1992. http://ora.ox.ac.uk/objects/uuid:caac5ed0-44e3-4bec-a97e-59e11ea268af.
Texto completo da fontep2andfrasl;27m3+O(m2). (1) We show that the number of groups of nilpotency class at most 3 and order pm satisfies (1). We prove a similar result concerning the number of graded Lie rings of order pm generated by their first grading.
Mishna, Marni. "Cayley graph enumeration". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ51422.pdf.
Texto completo da fonteShoilekova, Bilyana Todorova. "Graphical enumeration methods". Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526538.
Texto completo da fonteHannah, Stuart A. "Interval order enumeration". Thesis, University of Strathclyde, 2015. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=26137.
Texto completo da fonteEdeson, Margaret, e n/a. "Investigations in coset enumeration". University of Canberra. Information Sciences & Engineering, 1989. http://erl.canberra.edu.au./public/adt-AUC20050712.083514.
Texto completo da fonteOcansey, Evans Doe. "Enumeration problems on lattices". Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/80393.
Texto completo da fonteENGLISH ABSTRACT: The main objective of our study is enumerating spanning trees (G) and perfect matchings PM(G) on graphs G and lattices L. We demonstrate two methods of enumerating spanning trees of any connected graph, namely the matrix-tree theorem and as a special value of the Tutte polynomial T(G; x; y). We present a general method for counting spanning trees on lattices in d 2 dimensions. In particular we apply this method on the following regular lattices with d = 2: rectangular, triangular, honeycomb, kagomé, diced, 9 3 lattice and its dual lattice to derive a explicit formulas for the number of spanning trees of these lattices of finite sizes. Regarding the problem of enumerating of perfect matchings, we prove Cayley’s theorem which relates the Pfaffian of a skew symmetric matrix to its determinant. Using this and defining the Pfaffian orientation on a planar graph, we derive explicit formula for the number of perfect matchings on the following planar lattices; rectangular, honeycomb and triangular. For each of these lattices, we also determine the bulk limit or thermodynamic limit, which is a natural measure of the rate of growth of the number of spanning trees (L) and the number of perfect matchings PM(L). An algorithm is implemented in the computer algebra system SAGE to count the number of spanning trees as well as the number of perfect matchings of the lattices studied.
AFRIKAANSE OPSOMMING: Die hoofdoel van ons studie is die aftelling van spanbome (G) en volkome afparings PM(G) in grafieke G en roosters L. Ons beskou twee metodes om spanbome in ’n samehangende grafiek af te tel, naamlik deur middel van die matriks-boom-stelling, en as ’n spesiale waarde van die Tutte polinoom T(G; x; y). Ons behandel ’n algemene metode om spanbome in roosters in d 2 dimensies af te tel. In die besonder pas ons hierdie metode toe op die volgende reguliere roosters met d = 2: reghoekig, driehoekig, heuningkoek, kagomé, blokkies, 9 3 rooster en sy duale rooster. Ons bepaal eksplisiete formules vir die aantal spanbome in hierdie roosters van eindige grootte. Wat die aftelling van volkome afparings aanbetref, gee ons ’n bewys van Cayley se stelling wat die Pfaffiaan van ’n skeefsimmetriese matriks met sy determinant verbind. Met behulp van hierdie stelling en Pfaffiaanse oriënterings van planare grafieke bepaal ons eksplisiete formules vir die aantal volkome afparings in die volgende planare roosters: reghoekig, driehoekig, heuningkoek. Vir elk van hierdie roosters word ook die “grootmaat limiet” (of termodinamiese limiet) bepaal, wat ’n natuurlike maat vir die groeitempo van die aantaal spanbome (L) en die aantal volkome afparings PM(L) voorstel. ’n Algoritme is in die rekenaaralgebra-stelsel SAGE geimplementeer om die aantal spanboome asook die aantal volkome afparings in die toepaslike roosters af te tel.
Meier, Arne [Verfasser]. "Parametrised enumeration / Arne Meier". Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2020. http://d-nb.info/1206685859/34.
Texto completo da fonteRamos, Garrido Lander. "Graph enumeration and random graphs". Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/405943.
Texto completo da fonteEn aquesta tesi utilitzem l'analítica combinatòria per treballar amb dos problemes relacionats: enumeració de grafs i grafs aleatoris de classes de grafs amb restriccions. En particular ens interessa esbossar un dibuix general de determinades famílies de grafs determinant, en primer lloc, quants grafs hi ha de cada mida possible (enumeració de grafs), i, en segon lloc, quin és el comportament típic d'un element de mida fixa triat a l'atzar uniformement, quan aquesta mida tendeix a infinit (grafs aleatoris). Els problemes en què treballem tracten amb grafs que satisfan condicions globals, com ara ésser planars, o bé tenir restriccions en el grau dels vèrtexs. En el Capítol 2 analitzem grafs planar aleatoris amb grau mínim dos i tres. Mitjançant tècniques de combinatòria analítica i els conceptes de nucli i kernel d'un graf, obtenim estimacions asimptòtiques precises i analitzem paràmetres rellevants de grafs aleatoris, com ara el nombre d'arestes o la mida del nucli, on obtenim lleis límit gaussianes. També treballem amb un paràmetre que suposa un repte més important: el paràmetre extremal que es correspon amb la mida de l'arbre més gran que penja del nucli. En aquest cas obtenim una estimació logarítmica per al seu valor esperat, juntament amb un resultat sobre la seva concentració. En el Capítol 3 estudiem el nombre de subgrafs isomorfs a un graf fix en classes de grafs subcrítiques. Quan el graf fix és biconnex, obtenim lleis límit gaussianes amb esperança i variància lineals. L'eina principal és l'anàlisi de sistemes infinits d'equacions donada per Drmota, Gittenberger i Morgenbesser, que utilitza la teoria d'operadors compactes. El càlcul de les constants exactes de la primera estimació dels moments en general es troba fora del nostre abast. Per a la classe de grafs sèrie-paral·lels podem calcular les constants en alguns casos particulars interessants. En el Capítol 4 enumerem grafs (arbitraris) el grau de cada vèrtex dels quals pertany a un subconjunt fix dels nombres naturals. En aquest cas les funcions generatrius associades són divergents i la nostra anàlisi utilitza l'anomenat model de configuració. El nostre resultat consisteix a obtenir estimacions asimptòtiques precises per al nombre de grafs amb un nombre de vèrtexs i arestes donat, amb la restricció dels graus. Aquest resultat generalitza àmpliament casos particulars existents, com ara grafs d-regulars, o grafs amb grau mínim com a mínim d.
Postnikov, Alexander. "Enumeration in algebra and geometry". Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42693.
Texto completo da fonteEgebrand, August. "Feynman Diagrams and Map Enumeration". Thesis, Uppsala universitet, Teoretisk fysik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-298474.
Texto completo da fonteLivros sobre o assunto "Enumeraton"
Green, Linda L. 1890 Union veterans census: Special enumeration schedules, enumerating Union veterans and widows of the Civil War. Westminister, MD: Willow Bend Books, 2004.
Encontre o texto completo da fonteMarino, Andrea. Analysis and Enumeration. Paris: Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3.
Texto completo da fonteUnited States. Bureau of the Census, ed. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Encontre o texto completo da fonteUnited States. Bureau of the Census., ed. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Encontre o texto completo da fonteUnited States. Bureau of the Census., ed. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Encontre o texto completo da fonteUnited States. Bureau of the Census., ed. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Encontre o texto completo da fonteUnited States. Bureau of the Census, ed. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Encontre o texto completo da fonteUnited States. Bureau of the Census, ed. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Encontre o texto completo da fontePólya, George. Combinatorial enumeration of groups, graphs, and chemical compounds. New York: Springer-Verlag, 1987.
Encontre o texto completo da fontePólya, George. Combinatorial enumeration of groups, graphs, and chemical compounds. New York: Springer-Verlag, 1987.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Enumeraton"
Hanada, Hiroyuki, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi e Shin-ichi Minato. "Enumerating Eulerian Trails via Hamiltonian Path Enumeration". In WALCOM: Algorithms and Computation, 161–74. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15612-5_15.
Texto completo da fonteBendík, Jaroslav, e Kuldeep S. Meel. "Counting Minimal Unsatisfiable Subsets". In Computer Aided Verification, 313–36. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_15.
Texto completo da fonteSands, B. "Enumeration". In Graphs and Order, 523–27. Dordrecht: Springer Netherlands, 1985. http://dx.doi.org/10.1007/978-94-009-5315-4_17.
Texto completo da fonteSchröder, Bernd S. W. "Enumeration". In Ordered Sets, 263–93. Boston, MA: Birkhäuser Boston, 2003. http://dx.doi.org/10.1007/978-1-4612-0053-6_11.
Texto completo da fonteSanchis, Luis E. "Enumeration". In Reflexive Structures, 68–99. New York, NY: Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4612-3878-2_3.
Texto completo da fonteGutman, Ivan, e Sven Josef Cyvin. "Enumeration". In Introduction to the Theory of Benzenoid Hydrocarbons, 33–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-87143-6_4.
Texto completo da fonteConforti, Michele, Gérard Cornuéjols e Giacomo Zambelli. "Enumeration". In Graduate Texts in Mathematics, 351–88. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11008-0_9.
Texto completo da fonteRival, Ivan. "Enumeration". In Algorithms and Order, 483–86. Dordrecht: Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-2639-4_18.
Texto completo da fonteWeik, Martin H. "enumeration". In Computer Science and Communications Dictionary, 528. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_6312.
Texto completo da fonteSheikh, Ahmed. "Enumeration". In Certified Ethical Hacker (CEH) Preparation Guide, 27–34. Berkeley, CA: Apress, 2021. http://dx.doi.org/10.1007/978-1-4842-7258-9_3.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Enumeraton"
de Colnet, Alexis, e Pierre Marquis. "On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits". In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/358.
Texto completo da fonteArikawa, Keisuke. "Classification and Enumeration of Topological Structures of Robotic Mechanisms: Generation of Robotic Mechanisms With Unconventional Topological Structures". In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34992.
Texto completo da fonteJonnalagadda, Srinath, e Sundar Krishnamurty. "Modified Standard Codes in Enumeration and Automatic Sketching of Mechanisms". In ASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference. American Society of Mechanical Engineers, 1996. http://dx.doi.org/10.1115/96-detc/mech-1192.
Texto completo da fonteYan, Hong-Sen, Feng-Ming Ou e Ming-Feng Tang. "An Algorithm for the Enumeration of Serial and/or Parallel Combinations of Kinematic Building Blocks". In ASME 2004 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/detc2004-57295.
Texto completo da fonteGrégoire, Éric, Yacine Izza e Jean-Marie Lagniez. "Boosting MCSes Enumeration". In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/182.
Texto completo da fonteTsai, Lung-Wen, e Bharath Madhavan. "Systematic Enumeration of 1:1 Constant-Velocity Shaft Couplings". In ASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference. American Society of Mechanical Engineers, 1996. http://dx.doi.org/10.1115/96-detc/mech-1202.
Texto completo da fonteAbidi, Aman, Rui Zhou, Lu Chen e Chengfei Liu. "Pivot-based Maximal Biclique Enumeration". In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/492.
Texto completo da fonteMercan, Hanefi, Kamer Kaya e Cemal Yilmaz. "Enumerator: An Efficient Approach for Enumerating all Valid t-tuples". In 2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW). IEEE, 2018. http://dx.doi.org/10.1109/icstw.2018.00064.
Texto completo da fonteTerra-Neves, Miguel, Inês Lynce e Vasco Manquinho. "Multi-Objective Optimization Through Pareto Minimal Correction Subsets". In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/757.
Texto completo da fonteEriksson, Leif, e Victor Lagerkvist. "A Fast Algorithm for Consistency Checking Partially Ordered Time". In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/212.
Texto completo da fonteRelatórios de organizações sobre o assunto "Enumeraton"
Peñaloza, Rafael, e Barış Sertkaya. On the Complexity of Axiom Pinpointing in Description Logics. Technische Universität Dresden, 2009. http://dx.doi.org/10.25368/2022.173.
Texto completo da fonteCheikes, Brant A., David Waltermire e Karen Scarfone. Common platform enumeration :. Gaithersburg, MD: National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7695.
Texto completo da fonteParmelee, Mary C., Harold Booth, David Waltermire e Karen Scarfone. Common planform enumeration :. Gaithersburg, MD: National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7696.
Texto completo da fonteCichonski, Paul, David Waltermire e Karen Scarfone. Common platform enumeration :. Gaithersburg, MD: National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7697.
Texto completo da fonteWaltermire, David, Paul Cichonski e Karen Scarfone. Common platform enumeration :. Gaithersburg, MD: National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7698.
Texto completo da fonteSertkaya, Barış. Some Computational Problems Related to Pseudo-intents. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.169.
Texto completo da fonteVisco, Donald Patrick, Jr, Jean-Loup Michel Faulon e Diana C. Roe. Enumerating molecules. Office of Scientific and Technical Information (OSTI), abril de 2004. http://dx.doi.org/10.2172/918764.
Texto completo da fonteDamon, Craig A. Selective Enumeration: A Formal Definition. Fort Belvoir, VA: Defense Technical Information Center, janeiro de 1998. http://dx.doi.org/10.21236/ada339198.
Texto completo da fonteHugue, M. M. Fault Type Enumeration and Classification. Fort Belvoir, VA: Defense Technical Information Center, novembro de 1991. http://dx.doi.org/10.21236/ada242541.
Texto completo da fonteCroome, Amy, e Franziska Mager. Doing Research with Enumerators. Oxfam, novembro de 2018. http://dx.doi.org/10.21201/2018.3576.
Texto completo da fonte