Gotowa bibliografia na temat „Enumeraton”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Enumeraton”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Enumeraton"
Beigel, Richard, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan i Leen Torenvliet. "Enumerations of the Kolmogorov function". Journal of Symbolic Logic 71, nr 2 (czerwiec 2006): 501–28. http://dx.doi.org/10.2178/jsl/1146620156.
Pełny tekst źródłaShahrivari, Saeed, i Saeed Jalili. "Fast Parallel All-Subgraph Enumeration Using Multicore Machines". Scientific Programming 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/901321.
Pełny tekst źródłaSanei-Mehri, Seyed-Vahid, Apurba Das, Hooman Hashemi i Srikanta Tirthapura. "Mining Largest Maximal Quasi-Cliques". ACM Transactions on Knowledge Discovery from Data 15, nr 5 (26.06.2021): 1–21. http://dx.doi.org/10.1145/3446637.
Pełny tekst źródłaPreviti, Alessandro, i Joao Marques-Silva. "Partial MUS Enumeration". Proceedings of the AAAI Conference on Artificial Intelligence 27, nr 1 (30.06.2013): 818–25. http://dx.doi.org/10.1609/aaai.v27i1.8657.
Pełny tekst źródłavan der Rest, Cas, i Wouter Swierstra. "A completely unique account of enumeration". Proceedings of the ACM on Programming Languages 6, ICFP (29.08.2022): 411–37. http://dx.doi.org/10.1145/3547636.
Pełny tekst źródłaCallan, David, i Toufik Mansour. "On permutations avoiding 1324, 2143, and another 4-letter pattern". Pure Mathematics and Applications 26, nr 1 (27.06.2017): 1–10. http://dx.doi.org/10.1515/puma-2015-0018.
Pełny tekst źródłaCallan, David, i Toufik Mansour. "On permutations avoiding 1243, 2134, and another 4-letter pattern". Pure Mathematics and Applications 26, nr 1 (27.06.2017): 11–21. http://dx.doi.org/10.1515/puma-2015-0019.
Pełny tekst źródłaIMAI, HIROSHI, TOMONARI MASADA, FUMIHIKO TAKEUCHI i KEIKO IMAI. "ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS". International Journal of Computational Geometry & Applications 12, nr 06 (grudzień 2002): 455–80. http://dx.doi.org/10.1142/s0218195902000980.
Pełny tekst źródłaWatson, Derrick G., Elizabeth A. Maylor i 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, nr 6 (sierpień 2005): 1119–42. http://dx.doi.org/10.1080/02724980443000511.
Pełny tekst źródłaCHUNG, K. S., C. N. KIM i 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, nr 1 (1.01.2000): 123–25. http://dx.doi.org/10.4315/0362-028x-63.1.123.
Pełny tekst źródłaRozprawy doktorskie na temat "Enumeraton"
Blackburn, Simon R. "Group enumeration". Thesis, University of Oxford, 1992. http://ora.ox.ac.uk/objects/uuid:caac5ed0-44e3-4bec-a97e-59e11ea268af.
Pełny tekst źródłap2andfrasl;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.
Pełny tekst źródłaShoilekova, Bilyana Todorova. "Graphical enumeration methods". Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526538.
Pełny tekst źródłaHannah, 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.
Pełny tekst źródłaEdeson, Margaret, i n/a. "Investigations in coset enumeration". University of Canberra. Information Sciences & Engineering, 1989. http://erl.canberra.edu.au./public/adt-AUC20050712.083514.
Pełny tekst źródłaOcansey, Evans Doe. "Enumeration problems on lattices". Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/80393.
Pełny tekst źródłaENGLISH 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.
Pełny tekst źródłaRamos, Garrido Lander. "Graph enumeration and random graphs". Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/405943.
Pełny tekst źródłaEn 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.
Pełny tekst źródłaEgebrand, August. "Feynman Diagrams and Map Enumeration". Thesis, Uppsala universitet, Teoretisk fysik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-298474.
Pełny tekst źródłaKsiążki na temat "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.
Znajdź pełny tekst źródłaMarino, Andrea. Analysis and Enumeration. Paris: Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3.
Pełny tekst źródłaUnited States. Bureau of the Census, red. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Znajdź pełny tekst źródłaUnited States. Bureau of the Census., red. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Znajdź pełny tekst źródłaUnited States. Bureau of the Census., red. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Znajdź pełny tekst źródłaUnited States. Bureau of the Census., red. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Znajdź pełny tekst źródłaUnited States. Bureau of the Census, red. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Znajdź pełny tekst źródłaUnited States. Bureau of the Census, red. Service-based enumeration. [Washington, D.C.?]: U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.
Znajdź pełny tekst źródłaPólya, George. Combinatorial enumeration of groups, graphs, and chemical compounds. New York: Springer-Verlag, 1987.
Znajdź pełny tekst źródłaPólya, George. Combinatorial enumeration of groups, graphs, and chemical compounds. New York: Springer-Verlag, 1987.
Znajdź pełny tekst źródłaCzęści książek na temat "Enumeraton"
Hanada, Hiroyuki, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi i Shin-ichi Minato. "Enumerating Eulerian Trails via Hamiltonian Path Enumeration". W WALCOM: Algorithms and Computation, 161–74. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15612-5_15.
Pełny tekst źródłaBendík, Jaroslav, i Kuldeep S. Meel. "Counting Minimal Unsatisfiable Subsets". W Computer Aided Verification, 313–36. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_15.
Pełny tekst źródłaSands, B. "Enumeration". W Graphs and Order, 523–27. Dordrecht: Springer Netherlands, 1985. http://dx.doi.org/10.1007/978-94-009-5315-4_17.
Pełny tekst źródłaSchröder, Bernd S. W. "Enumeration". W Ordered Sets, 263–93. Boston, MA: Birkhäuser Boston, 2003. http://dx.doi.org/10.1007/978-1-4612-0053-6_11.
Pełny tekst źródłaSanchis, Luis E. "Enumeration". W Reflexive Structures, 68–99. New York, NY: Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4612-3878-2_3.
Pełny tekst źródłaGutman, Ivan, i Sven Josef Cyvin. "Enumeration". W 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.
Pełny tekst źródłaConforti, Michele, Gérard Cornuéjols i Giacomo Zambelli. "Enumeration". W Graduate Texts in Mathematics, 351–88. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11008-0_9.
Pełny tekst źródłaRival, Ivan. "Enumeration". W Algorithms and Order, 483–86. Dordrecht: Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-2639-4_18.
Pełny tekst źródłaWeik, Martin H. "enumeration". W Computer Science and Communications Dictionary, 528. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_6312.
Pełny tekst źródłaSheikh, Ahmed. "Enumeration". W Certified Ethical Hacker (CEH) Preparation Guide, 27–34. Berkeley, CA: Apress, 2021. http://dx.doi.org/10.1007/978-1-4842-7258-9_3.
Pełny tekst źródłaStreszczenia konferencji na temat "Enumeraton"
de Colnet, Alexis, i Pierre Marquis. "On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits". W 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.
Pełny tekst źródłaArikawa, Keisuke. "Classification and Enumeration of Topological Structures of Robotic Mechanisms: Generation of Robotic Mechanisms With Unconventional Topological Structures". W ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34992.
Pełny tekst źródłaJonnalagadda, Srinath, i Sundar Krishnamurty. "Modified Standard Codes in Enumeration and Automatic Sketching of Mechanisms". W 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.
Pełny tekst źródłaYan, Hong-Sen, Feng-Ming Ou i Ming-Feng Tang. "An Algorithm for the Enumeration of Serial and/or Parallel Combinations of Kinematic Building Blocks". W ASME 2004 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/detc2004-57295.
Pełny tekst źródłaGrégoire, Éric, Yacine Izza i Jean-Marie Lagniez. "Boosting MCSes Enumeration". W 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.
Pełny tekst źródłaTsai, Lung-Wen, i Bharath Madhavan. "Systematic Enumeration of 1:1 Constant-Velocity Shaft Couplings". W 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.
Pełny tekst źródłaAbidi, Aman, Rui Zhou, Lu Chen i Chengfei Liu. "Pivot-based Maximal Biclique Enumeration". W 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.
Pełny tekst źródłaMercan, Hanefi, Kamer Kaya i Cemal Yilmaz. "Enumerator: An Efficient Approach for Enumerating all Valid t-tuples". W 2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW). IEEE, 2018. http://dx.doi.org/10.1109/icstw.2018.00064.
Pełny tekst źródłaTerra-Neves, Miguel, Inês Lynce i Vasco Manquinho. "Multi-Objective Optimization Through Pareto Minimal Correction Subsets". W 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.
Pełny tekst źródłaEriksson, Leif, i Victor Lagerkvist. "A Fast Algorithm for Consistency Checking Partially Ordered Time". W 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.
Pełny tekst źródłaRaporty organizacyjne na temat "Enumeraton"
Peñaloza, Rafael, i Barış Sertkaya. On the Complexity of Axiom Pinpointing in Description Logics. Technische Universität Dresden, 2009. http://dx.doi.org/10.25368/2022.173.
Pełny tekst źródłaCheikes, Brant A., David Waltermire i Karen Scarfone. Common platform enumeration :. Gaithersburg, MD: National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7695.
Pełny tekst źródłaParmelee, Mary C., Harold Booth, David Waltermire i Karen Scarfone. Common planform enumeration :. Gaithersburg, MD: National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7696.
Pełny tekst źródłaCichonski, Paul, David Waltermire i Karen Scarfone. Common platform enumeration :. Gaithersburg, MD: National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7697.
Pełny tekst źródłaWaltermire, David, Paul Cichonski i Karen Scarfone. Common platform enumeration :. Gaithersburg, MD: National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7698.
Pełny tekst źródłaSertkaya, Barış. Some Computational Problems Related to Pseudo-intents. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.169.
Pełny tekst źródłaVisco, Donald Patrick, Jr, Jean-Loup Michel Faulon i Diana C. Roe. Enumerating molecules. Office of Scientific and Technical Information (OSTI), kwiecień 2004. http://dx.doi.org/10.2172/918764.
Pełny tekst źródłaDamon, Craig A. Selective Enumeration: A Formal Definition. Fort Belvoir, VA: Defense Technical Information Center, styczeń 1998. http://dx.doi.org/10.21236/ada339198.
Pełny tekst źródłaHugue, M. M. Fault Type Enumeration and Classification. Fort Belvoir, VA: Defense Technical Information Center, listopad 1991. http://dx.doi.org/10.21236/ada242541.
Pełny tekst źródłaCroome, Amy, i Franziska Mager. Doing Research with Enumerators. Oxfam, listopad 2018. http://dx.doi.org/10.21201/2018.3576.
Pełny tekst źródła