Bibliographies thématiques / Enumeraton

Littérature scientifique sur le sujet « Enumeraton »

Auteur : Grafiati

Publié le 25 mai 2024

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Articles de revues
Thèses
Livres
Chapitres de livres
Actes de conférences
Rapports d'organisations

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Enumeraton ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Enumeraton"

Beigel, Richard, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan et Leen Torenvliet. « Enumerations of the Kolmogorov function ». Journal of Symbolic Logic 71, n^o 2 (juin 2006) : 501–28. http://dx.doi.org/10.2178/jsl/1146620156.

Texte intégral

Résumé :

AbstractA recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x). f is a k(n)-enumerator if for every input x of length n. h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A.

Styles APA, Harvard, Vancouver, ISO, etc.

Shahrivari, Saeed, et Saeed Jalili. « Fast Parallel All-Subgraph Enumeration Using Multicore Machines ». Scientific Programming 2015 (2015) : 1–11. http://dx.doi.org/10.1155/2015/901321.

Texte intégral

Résumé :

Enumerating all subgraphs of an input graph is an important task for analyzing complex networks. Valuable information can be extracted about the characteristics of the input graph using all-subgraph enumeration. Notwithstanding, the number of subgraphs grows exponentially with growth of the input graph or by increasing the size of the subgraphs to be enumerated. Hence, all-subgraph enumeration is very time consuming when the size of the subgraphs or the input graph is big. We propose a parallel solution namedSubenumwhich in contrast to available solutions can perform much faster. Subenum enumerates subgraphs using edges instead of vertices, and this approach leads to a parallel and load-balanced enumeration algorithm that can have efficient execution on current multicore and multiprocessor machines. Also, Subenum uses a fast heuristic which can effectively accelerate non-isomorphism subgraph enumeration. Subenum can efficiently use external memory, and unlike other subgraph enumeration methods, it is not associated with the main memory limits of the used machine. Hence, Subenum can handle large input graphs and subgraph sizes that other solutions cannot handle. Several experiments are done using real-world input graphs. Compared to the available solutions, Subenum can enumerate subgraphs several orders of magnitude faster and the experimental results show that the performance of Subenum scales almost linearly by using additional processor cores.

Styles APA, Harvard, Vancouver, ISO, etc.

Sanei-Mehri, Seyed-Vahid, Apurba Das, Hooman Hashemi et Srikanta Tirthapura. « Mining Largest Maximal Quasi-Cliques ». ACM Transactions on Knowledge Discovery from Data 15, n^o 5 (26 juin 2021) : 1–21. http://dx.doi.org/10.1145/3446637.

Texte intégral

Résumé :

Quasi-cliques are dense incomplete subgraphs of a graph that generalize the notion of cliques. Enumerating quasi-cliques from a graph is a robust way to detect densely connected structures with applications in bioinformatics and social network analysis. However, enumerating quasi-cliques in a graph is a challenging problem, even harder than the problem of enumerating cliques. We consider the enumeration of top- k degree-based quasi-cliques and make the following contributions: (1) we show that even the problem of detecting whether a given quasi-clique is maximal (i.e., not contained within another quasi-clique) is NP-hard. (2) We present a novel heuristic algorithm K ernel QC to enumerate the k largest quasi-cliques in a graph. Our method is based on identifying kernels of extremely dense subgraphs within a graph, followed by growing subgraphs around these kernels, to arrive at quasi-cliques with the required densities. (3) Experimental results show that our algorithm accurately enumerates quasi-cliques from a graph, is much faster than current state-of-the-art methods for quasi-clique enumeration (often more than three orders of magnitude faster), and can scale to larger graphs than current methods.

Styles APA, Harvard, Vancouver, ISO, etc.

Previti, Alessandro, et Joao Marques-Silva. « Partial MUS Enumeration ». Proceedings of the AAAI Conference on Artificial Intelligence 27, n^o 1 (30 juin 2013) : 818–25. http://dx.doi.org/10.1609/aaai.v27i1.8657.

Texte intégral

Résumé :

Minimal explanations of infeasibility find a wide range of uses. In the Boolean domain, these are referred to as Minimal Unsatisfiable Subsets (MUSes). In some settings, one needs to enumerate MUSes of a Boolean formula. Most often the goal is to enumerate all MUSes. In cases where this is computationally infeasible, an alternative is to enumerate some MUSes. This paper develops a novel approach for partial enumeration of MUSes, that complements existing alternatives. If the enumeration of all MUSes is viable, then existing alternatives represent the best option. However, for formulas where the enumeration of all MUSes is unrealistic, our approach provides a solution for enumerating some MUSes within a given time bound. The experimental results focus on formulas for which existing solutions are unable to enumerate MUSes, and shows that the new approach can in most cases enumerate a non-negligible number of MUSes within a given time bound.

Styles APA, Harvard, Vancouver, ISO, etc.

van der Rest, Cas, et Wouter Swierstra. « A completely unique account of enumeration ». Proceedings of the ACM on Programming Languages 6, ICFP (29 août 2022) : 411–37. http://dx.doi.org/10.1145/3547636.

Texte intégral

Résumé :

How can we enumerate the inhabitants of an algebraic datatype? This paper explores a datatype generic solution that works for all regular types and indexed families . The enumerators presented here are provably both complete and unique —they will eventually produce every value exactly once—and fair —they avoid bias when composing enumerators. Finally, these enumerators memoise previously enumerated values whenever possible, thereby avoiding repeatedly recomputing recursive results.

Styles APA, Harvard, Vancouver, ISO, etc.

Callan, David, et Toufik Mansour. « On permutations avoiding 1324, 2143, and another 4-letter pattern ». Pure Mathematics and Applications 26, n^o 1 (27 juin 2017) : 1–10. http://dx.doi.org/10.1515/puma-2015-0018.

Texte intégral

Résumé :

Abstract We enumerate permutations avoiding 1324, 2143, and a third 4-letter pattern τ a step toward the goal of enumerating avoiders for all triples of 4-letter patterns. The enumeration is already known for all but five patterns τ, which are treated in this paper.

Styles APA, Harvard, Vancouver, ISO, etc.

Callan, David, et Toufik Mansour. « On permutations avoiding 1243, 2134, and another 4-letter pattern ». Pure Mathematics and Applications 26, n^o 1 (27 juin 2017) : 11–21. http://dx.doi.org/10.1515/puma-2015-0019.

Texte intégral

Résumé :

Abstract We enumerate permutations avoiding 1243, 2134, and a third 4-letter pattern τ, a step toward the goal of enumerating avoiders for all triples of 4-letter patterns. The enumeration is already known for all but three patterns τ, which are treated in this paper.

Styles APA, Harvard, Vancouver, ISO, etc.

IMAI, HIROSHI, TOMONARI MASADA, FUMIHIKO TAKEUCHI et KEIKO IMAI. « ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS ». International Journal of Computational Geometry & ; Applications 12, n^o 06 (décembre 2002) : 455–80. http://dx.doi.org/10.1142/s0218195902000980.

Texte intégral

Résumé :

We propose algorithms to enumerate (1) regular triangulations, (2) spanning regular triangulations, (3) equivalence classes of regular triangulations with respect to symmetry, and (4) all triangulations. All of the algorithms are for arbitrary points in general dimension. They work in output-size sensitive time with memory only of several times the size of a triangulation. For the enumeration of regular triangulations, we use the fact by Gel'fand, Zelevinskii and Kapranov that regular triangulations correspond to the vertices of the secondary polytope. We use reverse search technique by Avis and Fukuda, its extension for enumerating equivalence classes of objects, and a reformulation of a maximal independent set enumeration algorithm. The last approach can be extended for enumeration of dissections.

Styles APA, Harvard, Vancouver, ISO, etc.

Watson, Derrick G., Elizabeth A. Maylor et 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^o 6 (août 2005) : 1119–42. http://dx.doi.org/10.1080/02724980443000511.

Texte intégral

Résumé :

We investigated the effects of old age on search, subitizing, and counting of difficult-to-find targets. In Experiment 1, young and older adults enumerated targets (Os) with and without distractors (Qs). Without distractors, the usual subitization-counting function occurred in both groups, with the same subitization span of 3.3 items. Subitization disappeared with distractors; older adults were slowed more overall by their presence but enumeration rates were not slowed by ageing either with or without distractors. In contrast, search rates for a single target (O among Qs) were twice as slow for older as for young adults. Experiment 2 tested and ruled out one account of age-equivalent serial enumeration based on the need to subvocalize numbers as items are enumerated. Alternative explanations based on the specific task differences between detecting and enumerating stimuli are discussed.

Styles APA, Harvard, Vancouver, ISO, etc.

CHUNG, K. S., C. N. KIM et 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^o 1 (1 janvier 2000) : 123–25. http://dx.doi.org/10.4315/0362-028x-63.1.123.

Texte intégral

Résumé :

The 3M Petrifilm rapid coliform count (RCC) plate method was compared with two conventional methods, namely violet red bile agar (VRBA) and desoxycholate lactose agar (DLA), for enumerating coliforms. The VRBA plating method is a reference method in the Bacteriological Analytical Manual and the DLA plating method is the method recommended by the Food Sanitation Law of Korea for enumeration of coliforms. Serratia sp., a coliform that was isolated from frozen surimi, was incubated in surimi-based imitation crab (SBIC) slurries and enumerated on the Petrifilm RCC, VRBA, and DLA plates. Results from the Petrifilm RCC plate were not significantly different from results from VRBA or DLA plates at P < 0.05 level. The correlation coefficient for Petrifilm RCC plates versus the VRBA method and for Petrifilm RCC plates versus the DLA method were 0.994 and 0.996, respectively. With the Petrifilm RCC plate method, we were able to estimate presumptive coliforms (except Serratia sp.) after 14 h and to enumerate confirmed coliforms (including Serratia sp.) after 24 h.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "Enumeraton"

Blackburn, Simon R. « Group enumeration ». Thesis, University of Oxford, 1992. http://ora.ox.ac.uk/objects/uuid:caac5ed0-44e3-4bec-a97e-59e11ea268af.

Texte intégral

Résumé :

The thesis centres around two problems in the enumeration of p-groups. Define f_φ(p^m) to be the number of (isomorphism classes of) groups of order p^m in an isoclinism class φ. We give bounds for this function as φ is fixed and m varies and as m is fixed and φ varies. In the course of obtaining these bounds, we prove the following result. We say a group is reduced if it has no non-trivial abelian direct factors. Then the rank of the centre Z(P) and the rank of the derived factor group P|P' of a reduced p-group P are bounded in terms of the orders of P|Z(P)P' and P'∩Z(P). A long standing conjecture of Charles C. Sims states that the number of groups of order p^m is
p^{²andfrasl;₂₇m³+O(m²)}. (1) We show that the number of groups of nilpotency class at most 3 and order p^m satisfies (1). We prove a similar result concerning the number of graded Lie rings of order p^m generated by their first grading.

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Shoilekova, Bilyana Todorova. « Graphical enumeration methods ». Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526538.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Hannah, 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.

Texte intégral

Résumé :

This thesis continues the study of interval orders and related structures, containing results on both the labeled and unlabeled variants. Following a result of Eriksen and Sjöstrand (2014) we identify a link between structures following the Fishburn distribution and Mahonian structures. This is used to detail a technique for the construction of Fishburn structures (structures in bijection with unlabeled interval orders) from appropriate Mahonian structures. This technique is introduced on a bivincular pattern of Bousquet-Mélou et al. (2010) and then used to introduce a previously unconsidered class of matchings; explicitly, zero alignment matchings according to the number of arcs which are both right-crossed and left-nesting. The technique is then used to identify a statistic on the factorial posets of Claesson and Linusson (2011) following the Fishburn distribution. Factorial posets mapped to zero by this statistic are canonically labeled factorial posets which may alternatively be viewed as unlabeled interval orders. As a consequence of our approach we find an identity for the Fishburn numbers in terms of the Mahonian numbers and discuss linear combinations of Fishburn patterns in a manner similar to that of the Mahonian combinations of Babson and Steingrímsson (2001). To study labeled interval orders we introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. Adapting a bijection of Dukes, Jelínek and Kibitzke (2011), we show that matrices fixed under this involution are in bijection with labeled interval orders and that they decompose to a pair consisting of a permutation and an inversion table. To fully classify such pairs results pertaining to the enumeration of permutations having a given set of ascent bottoms are given. This allows for a new formula for the number of labeled interval orders.

Styles APA, Harvard, Vancouver, ISO, etc.

Edeson, Margaret, et n/a. « Investigations in coset enumeration ». University of Canberra. Information Sciences & ; Engineering, 1989. http://erl.canberra.edu.au./public/adt-AUC20050712.083514.

Texte intégral

Résumé :

The process of coset enumeration has become a significant factor in group theoretical investigations since the advent of modern computing power, but in some respects the process is still not well understood. This thesis investigates some features of coset enumeration, working mainly with the group F(2,7). Chapter 1 describes the characteristics of coset enumeration and algorithms used for it. A worked example of the method is provided. Chapter 2 discusses some features which would be desirable in computer programs for use in investigating the coset enumeration process itself, and reviews the Havas/Alford program which to date best meets the requirements. Chapter 3 deals with the use of coset ammeration in proofs, either in its own right or as a basis for other workings. An example of one attempt to obtain a proof by coset enumeration is given. Chapter 4 reviews techniques designed to reduce the length of coset enumerations and proposes the 'equality list' technique as a way to reduce enumeration length for some groups. Extra insights obtainable using the equality list method are also discussed. Chapter 5 summarises the factors by which the success of different coset enumerations can be compared and proposes an algorithm for making systematic comparisons among enumerations. Chapter 6 reports five coset enumerations, obtained manually by three main methods on the group F(2,7). All these enumerations were shorter than is so far obtainable by machine and one is shorter than other known hand enumerations. The enumerations were compared by applying the process developed in Chapter 5. Chapter 7 presents a shorter proof of the cyclicity of the group F(2,7) than was hitherto available. The proof derives from the workings for one of the coset enumerations described in Chapter 6. There are eight appendices and an annotated bibliography. The appendices contain, inter alia, edited correspondence between well-known coset-enumerators, a guide to the Havas/Alford program, further details on the equality list method and listings of various enumerations.

Styles APA, Harvard, Vancouver, ISO, etc.

Ocansey, Evans Doe. « Enumeration problems on lattices ». Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/80393.

Texte intégral

Résumé :

Thesis (MSc)--Stellenbosch University, 2013.
ENGLISH 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.

Styles APA, Harvard, Vancouver, ISO, etc.

Meier, Arne [Verfasser]. « Parametrised enumeration / Arne Meier ». Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2020. http://d-nb.info/1206685859/34.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Ramos, Garrido Lander. « Graph enumeration and random graphs ». Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/405943.

Texte intégral

Résumé :

In this thesis we use analytic combinatorics to deal with two related problems: graph enumeration and random graphs from constrained classes of graphs. We are interested in drawing a general picture of some graph families by determining, first, how many elements are there of a given possible size (graph enumeration), and secondly, what is the typical behaviour of an element of fixed size chosen uniformly at random, when the size tends to infinity (random graphs). The problems concern graphs subject to global conditions, such as being planar and/or with restrictions on the degrees of the vertices. In Chapter 2 we analyse random planar graphs with minimum degree two and three. Using techniques from analytic combinatorics and the concepts of core and kernel of a graph, we obtain precise asymptotic estimates and analyse relevant parameters for random graphs, such as the number of edges or the size of the core, where we obtain Gaussian limit laws. More challenging is the extremal parameter equal to the size of the largest tree attached to the core. In this case we obtain a logarithmic estimate for the expected value together with a concentration result. In Chapter 3 we study the number of subgraphs isomorphic to a fixed graph in subcritical classes of graphs. We obtain Gaussian limit laws with linear expectation and variance when the fixed graph is 2-connected. The main tool is the analysis of infinite systems of equations by Drmota, Gittenberger and Morgenbesser, using the theory of compact operators. Computing the exact constants for the first estimates of the moments is in general out of reach. For the class of series-parallel graphs we are able to compute them in some particular interesting cases. In Chapter 4 we enumerate (arbitrary) graphs where the degree of every vertex belongs to a fixed subset of the natural numbers. In this case the associated generating functions are divergent and our analysis uses instead the so-called configuration model. We obtain precise asymptotic estimates for the number of graphs with given number of vertices and edges and subject to the degree restriction. Our results generalize widely previous special cases, such as d-regular graphs or graphs with minimum degree at least d.
En 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.

Styles APA, Harvard, Vancouver, ISO, etc.

Postnikov, Alexander. « Enumeration in algebra and geometry ». Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42693.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Egebrand, August. « Feynman Diagrams and Map Enumeration ». Thesis, Uppsala universitet, Teoretisk fysik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-298474.

Texte intégral

Résumé :

The goal of this thesis is to count how many graphs exist given a number of verticesor some other restrictions. The graphs are counted by perturbing Gaussian integralsand using the Wick lemma to interpret the perturbations in terms of graphs. Fatgraphs, a specific type of graph, are central in this thesis. A method based onorthogonal polynomials to count fat graphs is presented. The thesis finishes with theformulation and some results related to the three-color problem.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Livres sur le sujet "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.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Marino, Andrea. Analysis and Enumeration. Paris : Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

United States. Bureau of the Census, dir. Service-based enumeration. [Washington, D.C.?] : U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

United States. Bureau of the Census., dir. Service-based enumeration. [Washington, D.C.?] : U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

United States. Bureau of the Census., dir. Service-based enumeration. [Washington, D.C.?] : U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

United States. Bureau of the Census., dir. Service-based enumeration. [Washington, D.C.?] : U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

United States. Bureau of the Census, dir. Service-based enumeration. [Washington, D.C.?] : U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

United States. Bureau of the Census, dir. Service-based enumeration. [Washington, D.C.?] : U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Pólya, George. Combinatorial enumeration of groups, graphs, and chemical compounds. New York : Springer-Verlag, 1987.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Pólya, George. Combinatorial enumeration of groups, graphs, and chemical compounds. New York : Springer-Verlag, 1987.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Chapitres de livres sur le sujet "Enumeraton"

Hanada, Hiroyuki, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi et Shin-ichi Minato. « Enumerating Eulerian Trails via Hamiltonian Path Enumeration ». Dans WALCOM : Algorithms and Computation, 161–74. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15612-5_15.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Bendík, Jaroslav, et Kuldeep S. Meel. « Counting Minimal Unsatisfiable Subsets ». Dans Computer Aided Verification, 313–36. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_15.

Texte intégral

Résumé :

AbstractGiven an unsatisfiable Boolean formula F in CNF, an unsatisfiable subset of clauses U of F is called Minimal Unsatisfiable Subset (MUS) if every proper subset of U is satisfiable. Since MUSes serve as explanations for the unsatisfiability of F, MUSes find applications in a wide variety of domains. The availability of efficient SAT solvers has aided the development of scalable techniques for finding and enumerating MUSes in the past two decades. Building on the recent developments in the design of scalable model counting techniques for SAT, Bendík and Meel initiated the study of MUS counting techniques. They succeeded in designing the first approximate MUS counter, $$\mathsf {AMUSIC}$$ AMUSIC , that does not rely on exhaustive MUS enumeration. $$\mathsf {AMUSIC}$$ AMUSIC , however, suffers from two shortcomings: the lack of exact estimates and limited scalability due to its reliance on 3-QBF solvers.In this work, we address the two shortcomings of $$\mathsf {AMUSIC}$$ AMUSIC by designing the first exact MUS counter, $$\mathsf {CountMUST}$$ CountMUST , that does not rely on exhaustive enumeration. $$\mathsf {CountMUST}$$ CountMUST circumvents the need for 3-QBF solvers by reducing the problem of MUS counting to projected model counting. While projected model counting is #NP-hard, the past few years have witnessed the development of scalable projected model counters. An extensive empirical evaluation demonstrates that $$\mathsf {CountMUST}$$ CountMUST successfully returns MUS count for 1500 instances while $$\mathsf {AMUSIC}$$ AMUSIC and enumeration-based techniques could only handle up to 833 instances.

Styles APA, Harvard, Vancouver, ISO, etc.

Sands, B. « Enumeration ». Dans Graphs and Order, 523–27. Dordrecht : Springer Netherlands, 1985. http://dx.doi.org/10.1007/978-94-009-5315-4_17.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Schröder, Bernd S. W. « Enumeration ». Dans Ordered Sets, 263–93. Boston, MA : Birkhäuser Boston, 2003. http://dx.doi.org/10.1007/978-1-4612-0053-6_11.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Sanchis, Luis E. « Enumeration ». Dans Reflexive Structures, 68–99. New York, NY : Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4612-3878-2_3.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Gutman, Ivan, et Sven Josef Cyvin. « Enumeration ». Dans 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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Conforti, Michele, Gérard Cornuéjols et Giacomo Zambelli. « Enumeration ». Dans Graduate Texts in Mathematics, 351–88. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11008-0_9.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Rival, Ivan. « Enumeration ». Dans Algorithms and Order, 483–86. Dordrecht : Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-2639-4_18.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Weik, Martin H. « enumeration ». Dans Computer Science and Communications Dictionary, 528. Boston, MA : Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_6312.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Sheikh, Ahmed. « Enumeration ». Dans Certified Ethical Hacker (CEH) Preparation Guide, 27–34. Berkeley, CA : Apress, 2021. http://dx.doi.org/10.1007/978-1-4842-7258-9_3.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Enumeraton"

de Colnet, Alexis, et Pierre Marquis. « On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits ». Dans 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.

Texte intégral

Résumé :

We consider the problem Enum·IP of enumerating prime implicants of Boolean functions represented by decision decomposable negation normal form (dec-DNNF) circuits. We study Enum·IP from dec-DNNF within the framework of enumeration complexity and prove that it is in OutputP, the class of output polynomial enumeration problems, and more precisely in IncP, the class of polynomial incremental time enumeration problems. We then focus on two closely related, but seemingly harder, enumeration problems where further restrictions are put on the prime implicants to be generated. In the first problem, one is only interested in prime implicants representing subset-minimal abductive explanations, a notion much investigated in AI for more than thirty years. In the second problem, the target is prime implicants representing sufficient reasons, a recent yet important notion in the emerging field of eXplainable AI, since they aim to explain predictions achieved by machine learning classifiers. We provide evidence showing that enumerating specific prime implicants corresponding to subset-minimal abductive explanations or to sufficient reasons is not in OutputP.

Styles APA, Harvard, Vancouver, ISO, etc.

Arikawa, Keisuke. « Classification and Enumeration of Topological Structures of Robotic Mechanisms : Generation of Robotic Mechanisms With Unconventional Topological Structures ». Dans ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34992.

Texte intégral

Résumé :

This paper discusses the classification and enumeration of topological structures of robotic mechanisms, aiming to develop practical robotic mechanisms with unconventional topological structures. First, we consider the features of topological structures of conventional robotic mechanisms and we point out that almost all of these can be constructed by using only one simple basic unit and two simple connection rules. Then, we present an efficient way to enumerate the topological structures which cannot be constructed from the basic unit and the connection rules, or unconventional topological structures. Then, we discuss the sequence required to construct robotic mechanisms from the enumerated unconventional topological structures. In the discussion, some effective tools, “graph division”, “graph management tool” and “DOF setting based on Kuzbach criterion”, which help designers construct a variety of mechanisms from the same topological structure are introduced. Finally, some examples of the sequences allowing the generation of robotic mechanisms with unconventional topological structures are shown.

Styles APA, Harvard, Vancouver, ISO, etc.

Jonnalagadda, Srinath, et Sundar Krishnamurty. « Modified Standard Codes in Enumeration and Automatic Sketching of Mechanisms ». Dans 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.

Texte intégral

Résumé :

Abstract This paper presents the application of modified standard codes in the systematic enumeration and graphical display of non-isomorphic mechanisms. A two-stage enumeration procedure is presented that involves the identification and generation of contracted graphs using modified standard codes. In this scheme, unique numbering reflecting the symmetry properties of the higher order links deduced from these contracted graphs is propagated to the second stage in which all the non-isomorphic kinematic chains corresponding to each contracted graph are enumerated. The integration of the resulting numerical code values with a robust automatic sketching algorithm provides the basis for the systematic enumeration and pictorial displays of basic kinematic chains. Illustrative examples from the enumeration of basic kinematic chains with up to 12 bar 3 degree of freedom system are presented, and the results are discussed.

Styles APA, Harvard, Vancouver, ISO, etc.

Yan, Hong-Sen, Feng-Ming Ou et Ming-Feng Tang. « An Algorithm for the Enumeration of Serial and/or Parallel Combinations of Kinematic Building Blocks ». Dans ASME 2004 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/detc2004-57295.

Texte intégral

Résumé :

An algorithm is presented, based on graph theory, for enumerating all feasible serial and/or parallel combined mechanisms from the given rotary or translational power source and specific kinematic building blocks. Through the labeled out-tree representations for the configurations of combined mechanisms, the enumeration procedure is developed by adapting the algorithm for the enumeration of trees. A rotary power source and four kinematic building blocks: a crank-rocker linkage, a rack-pinion, a double-slider mechanism, and a cam-follower mechanism, are chosen as the combination to illustrate the algorithm. And, two examples are provided to validate the algorithm.

Styles APA, Harvard, Vancouver, ISO, etc.

Grégoire, Éric, Yacine Izza et Jean-Marie Lagniez. « Boosting MCSes Enumeration ». Dans 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.

Texte intégral

Résumé :

The enumeration of all Maximal Satisfiable Subsets (MSSes) or all Minimal Correction Subsets (MCSes) of an unsatisfiable CNF Boolean formula is a useful and sometimes necessary step for solving a variety of important A.I. issues. Although the number of different MCSes of a CNF Boolean formula is exponential in the worst case, it remains low in many practical situations; this makes the tentative enumeration possibly successful in these latter cases. In the paper, a technique is introduced that boosts the currently most efficient practical approaches to enumerate MCSes. It implements a model rotation paradigm that allows the set of MCSes to be computed in an heuristically efficient way.

Styles APA, Harvard, Vancouver, ISO, etc.

Tsai, Lung-Wen, et Bharath Madhavan. « Systematic Enumeration of 1:1 Constant-Velocity Shaft Couplings ». Dans 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.

Texte intégral

Résumé :

Abstract A systematic methodology is employed for the enumeration of 1:-1 constant-velocity shaft couplings. As a result, four potential 1:-1 constant-velocity shaft couplings that are free from singular conditions are enumerated. A promising mechanism is selected for the dynamic analysis. The analysis shows that the mechanism does have the potential for use as a 1:-1 constant-velocity shaft coupling and as a gearless differential.

Styles APA, Harvard, Vancouver, ISO, etc.

Abidi, Aman, Rui Zhou, Lu Chen et Chengfei Liu. « Pivot-based Maximal Biclique Enumeration ». Dans 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.

Texte intégral

Résumé :

Enumerating maximal bicliques in a bipartite graph is an important problem in data mining, with innumerable real-world applications across different domains such as web community, bioinformatics, etc. Although substantial research has been conducted on this problem, surprisingly, we find that pivot-based search space pruning, which is quite effective in clique enumeration, has not been exploited in biclique scenario. Therefore, in this paper, we explore the pivot-based pruning for biclique enumeration. We propose an algorithm for implementing the pivot-based pruning, powered by an effective index structure Containment Directed Acyclic Graph (CDAG). Meanwhile, existing literature indicates contradictory findings on the order of vertex selection in biclique enumeration. As such, we re-examine the problem and suggest an offline ordering of vertices which expedites the pivot pruning. We conduct an extensive performance study using real-world datasets from a wide range of domains. The experimental results demonstrate that our algorithm is more scalable and outperforms all the existing algorithms across all datasets and can achieve a significant speedup against the previous algorithms.

Styles APA, Harvard, Vancouver, ISO, etc.

Mercan, Hanefi, Kamer Kaya et Cemal Yilmaz. « Enumerator : An Efficient Approach for Enumerating all Valid t-tuples ». Dans 2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW). IEEE, 2018. http://dx.doi.org/10.1109/icstw.2018.00064.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Terra-Neves, Miguel, Inês Lynce et Vasco Manquinho. « Multi-Objective Optimization Through Pareto Minimal Correction Subsets ». Dans 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.

Texte intégral

Résumé :

A Minimal Correction Subset (MCS) of an unsatisfiable constraint set is a minimal subset of constraints that, if removed, makes the constraint set satisfiable. MCSs enjoy a wide range of applications, such as finding approximate solutions to constrained optimization problems. However, existing work on applying MCS enumeration to optimization problems focuses on the single-objective case. In this work, Pareto Minimal Correction Subsets (Pareto-MCSs) are proposed for approximating the Pareto-optimal solution set of multi-objective constrained optimization problems. We formalize and prove an equivalence relationship between Pareto-optimal solutions and Pareto-MCSs. Moreover, Pareto-MCSs and MCSs can be connected in such a way that existing state-of-the-art MCS enumeration algorithms can be used to enumerate Pareto-MCSs. Finally, experimental results on the multi-objective virtual machine consolidation problem show that the Pareto-MCS approach is competitive with state-of-the-art algorithms.

Styles APA, Harvard, Vancouver, ISO, etc.

Eriksson, Leif, et Victor Lagerkvist. « A Fast Algorithm for Consistency Checking Partially Ordered Time ». Dans 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.

Texte intégral

Résumé :

Partially ordered models of time occur naturally in applications where agents/processes cannot perfectly communicate with each other, and can be traced back to the seminal work of Lamport. In this paper we consider the problem of deciding if a (likely incomplete) description of a system of events is consistent, the network consistency problem for the point algebra of partially ordered time (POT). While the classical complexity of this problem has been fully settled, comparably little is known of the fine-grained complexity of POT except that it can be solved in O*((0.368n)^n) time by enumerating ordered partitions. We construct a much faster algorithm with a run-time bounded by O*((0.26n)^n), which, e.g., is roughly 1000 times faster than the naive enumeration algorithm in a problem with 20 events. This is achieved by a sophisticated enumeration of structures similar to total orders, which are then greedily expanded toward a solution. While similar ideas have been explored earlier for related problems it turns out that the analysis for POT is non-trivial and requires significant new ideas.

Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Enumeraton"

Peñaloza, Rafael, et Barış Sertkaya. On the Complexity of Axiom Pinpointing in Description Logics. Technische Universität Dresden, 2009. http://dx.doi.org/10.25368/2022.173.

Texte intégral

Résumé :

We investigate the computational complexity of axiom pinpointing in Description Logics, which is the task of finding minimal subsets of a knowledge base that have a given consequence. We consider the problems of enumerating such subsets with and without order, and show hardness results that already hold for the propositional Horn fragment, or for the Description Logic EL. We show complexity results for several other related decision and enumeration problems for these fragments that extend to more expressive logics. In particular we show that hardness of these problems depends not only on expressivity of the fragment but also on the shape of the axioms used.

Styles APA, Harvard, Vancouver, ISO, etc.

Cheikes, Brant A., David Waltermire et Karen Scarfone. Common platform enumeration :. Gaithersburg, MD : National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7695.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Parmelee, Mary C., Harold Booth, David Waltermire et Karen Scarfone. Common planform enumeration :. Gaithersburg, MD : National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7696.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Cichonski, Paul, David Waltermire et Karen Scarfone. Common platform enumeration :. Gaithersburg, MD : National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7697.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Waltermire, David, Paul Cichonski et Karen Scarfone. Common platform enumeration :. Gaithersburg, MD : National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.ir.7698.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Sertkaya, Barış. Some Computational Problems Related to Pseudo-intents. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.169.

Texte intégral

Résumé :

We investigate the computational complexity of several decision, enumeration and counting problems related to pseudo-intents. We show that given a formal context and a set of its pseudo-intents, checking whether this context has an additional pseudo-intent is in conp and it is at least as hard as checking whether a given simple hypergraph is saturated. We also show that recognizing the set of pseudo-intents is also in conp and it is at least as hard as checking whether a given hypergraph is the transversal hypergraph of another given hypergraph. Moreover, we show that if any of these two problems turns out to be conp-hard, then unless p = np, pseudo-intents cannot be enumerated in output polynomial time. We also investigate the complexity of finding subsets of a given Duquenne-Guigues Base from which a given implication follows. We show that checking the existence of such a subset within a specified cardinality bound is np-complete, and counting all such minimal subsets is #p-complete.

Styles APA, Harvard, Vancouver, ISO, etc.

Visco, Donald Patrick, Jr, Jean-Loup Michel Faulon et Diana C. Roe. Enumerating molecules. Office of Scientific and Technical Information (OSTI), avril 2004. http://dx.doi.org/10.2172/918764.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Damon, Craig A. Selective Enumeration : A Formal Definition. Fort Belvoir, VA : Defense Technical Information Center, janvier 1998. http://dx.doi.org/10.21236/ada339198.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Hugue, M. M. Fault Type Enumeration and Classification. Fort Belvoir, VA : Defense Technical Information Center, novembre 1991. http://dx.doi.org/10.21236/ada242541.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Croome, Amy, et Franziska Mager. Doing Research with Enumerators. Oxfam, novembre 2018. http://dx.doi.org/10.21201/2018.3576.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!