Relevant bibliographies by topics / Enumeraton

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Enumeraton'

Author: Grafiati
Published: 25 May 2024
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Enumeraton.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Enumeraton"

1

Beigel, Richard, Harry Buhrman, Peter Fejer, et al. "Enumerations of the Kolmogorov function." Journal of Symbolic Logic 71, no. 2 (2006): 501–28. http://dx.doi.org/10.2178/jsl/1146620156.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
Abstract:
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 enume
APA, Harvard, Vancouver, ISO, and other styles
3

Sanei-Mehri, Seyed-Vahid, Apurba Das, Hooman Hashemi, and Srikanta Tirthapura. "Mining Largest Maximal Quasi-Cliques." ACM Transactions on Knowledge Discovery from Data 15, no. 5 (2021): 1–21. http://dx.doi.org/10.1145/3446637.

Full text
Abstract:
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 ano
APA, Harvard, Vancouver, ISO, and other styles
4

Balasubramanian, Krishnan. "Enumeration of n-Dimensional Hypercubes, Icosahedra, Rubik’s Cube Dice, Colorings, Chirality, and Encryptions Based on Their Symmetries." Symmetry 16, no. 8 (2024): 1020. http://dx.doi.org/10.3390/sym16081020.

Full text
Abstract:
The whimsical Las Vegas/Monte Carlo cubic dice are generalized to construct the combinatorial problem of enumerating all n-dimensional hypercube dice and dice of other shapes that exhibit cubic, icosahedral, and higher symmetries. By utilizing powerful generating function techniques for various irreducible representations, we derive the combinatorial enumerations of all possible dice in n-dimensional space with hyperoctahedral symmetries. Likewise, a number of shapes that exhibit icosahedral symmetries such as a truncated dodecahedron and a truncated icosahedron are considered for the combinat
APA, Harvard, Vancouver, ISO, and other styles
5

Previti, Alessandro, and Joao Marques-Silva. "Partial MUS Enumeration." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (2013): 818–25. http://dx.doi.org/10.1609/aaai.v27i1.8657.

Full text
Abstract:
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 th
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
7

Callan, David, and Toufik Mansour. "On permutations avoiding 1324, 2143, and another 4-letter pattern." Pure Mathematics and Applications 26, no. 1 (2017): 1–10. http://dx.doi.org/10.1515/puma-2015-0018.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
8

Callan, David, and Toufik Mansour. "On permutations avoiding 1243, 2134, and another 4-letter pattern." Pure Mathematics and Applications 26, no. 1 (2017): 11–21. http://dx.doi.org/10.1515/puma-2015-0019.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
9

IMAI, HIROSHI, TOMONARI MASADA, FUMIHIKO TAKEUCHI, and KEIKO IMAI. "ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS." International Journal of Computational Geometry & Applications 12, no. 06 (2002): 455–80. http://dx.doi.org/10.1142/s0218195902000980.

Full text
Abstract:
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 a
APA, Harvard, Vancouver, ISO, and other styles
10

Watson, Derrick G., Elizabeth A. Maylor, and 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, no. 6 (2005): 1119–42. http://dx.doi.org/10.1080/02724980443000511.

Full text
Abstract:
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 fo
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Enumeraton"

1

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

Full text
Abstract:
The thesis centres around two problems in the enumeration of p-groups. Define f<sub>φ</sub>(p<sup>m</sup>) to be the number of (isomorphism classes of) groups of order p<sup>m</sup> 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
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
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 Sjö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-Mélou et al. (2010) and then used to introduce a previously unconsidere
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
Abstract:
Thesis (MSc)--Stellenbosch University, 2013.<br>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 lattic
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
Abstract:
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 verti
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Enumeraton"

1

Green, Linda L. 1890 Union veterans census: Special enumeration schedules, enumerating Union veterans and widows of the Civil War. Willow Bend Books, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

United States. Bureau of the Census, ed. Service-based enumeration. U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

United States. Bureau of the Census., ed. Service-based enumeration. U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

United States. Bureau of the Census., ed. Service-based enumeration. U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

United States. Bureau of the Census., ed. Service-based enumeration. U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

United States. Bureau of the Census, ed. Service-based enumeration. U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

United States. Bureau of the Census, ed. Service-based enumeration. U.S. Dept. of Commerce, Economics and Statistics Administration, U.S. Bureau of the Census, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Koganov, L. M. Psevdoporozhdaemye dvukhindeksnye posledovatelʹnosti. "Nedra", 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Enumeraton"

1

Van Caudenberg, Daimy, Bart Bogaerts, and Leandro Vendramin. "Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-90653-4_1.

Full text
Abstract:
Abstract We tackle the problem of enumerating set-theoretic solutions to the Yang-Baxter equation. This equation originates from statistical and quantum mechanics, but also has applications in knot theory, cryptography, quantum computation and group theory. Non-degenerate, involutive solutions have been enumerated for sets up to size 10 using constraint programming with partial static symmetry breaking [1]; for general non-involutive solutions, a similar approach was used to enumerate solutions for sets up to size 8. In this paper, we use and extend the SAT Modulo Symmetries framework (SMS), t
APA, Harvard, Vancouver, ISO, and other styles
2

Hanada, Hiroyuki, Shuhei Denzumi, Yuma Inoue, et al. "Enumerating Eulerian Trails via Hamiltonian Path Enumeration." In WALCOM: Algorithms and Computation. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15612-5_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bendík, Jaroslav, and Kuldeep S. Meel. "Counting Minimal Unsatisfiable Subsets." In Computer Aided Verification. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_15.

Full text
Abstract:
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 cou
APA, Harvard, Vancouver, ISO, and other styles
4

Sands, B. "Enumeration." In Graphs and Order. Springer Netherlands, 1985. http://dx.doi.org/10.1007/978-94-009-5315-4_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Schröder, Bernd S. W. "Enumeration." In Ordered Sets. Birkhäuser Boston, 2003. http://dx.doi.org/10.1007/978-1-4612-0053-6_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sanchis, Luis E. "Enumeration." In Reflexive Structures. Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4612-3878-2_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gutman, Ivan, and Sven Josef Cyvin. "Enumeration." In Introduction to the Theory of Benzenoid Hydrocarbons. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-87143-6_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Conforti, Michele, Gérard Cornuéjols, and Giacomo Zambelli. "Enumeration." In Graduate Texts in Mathematics. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11008-0_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rival, Ivan. "Enumeration." In Algorithms and Order. Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-2639-4_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Weik, Martin H. "enumeration." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_6312.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Enumeraton"

1

Lagniez, Jean-Marie, and Emmanuel Lonca. "Leveraging Decision-DNNF Compilation for Enumerating Disjoint Partial Models." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/48.

Full text
Abstract:
The All-Solution Satisfiability Problem (AllSAT) extends SAT by requiring the identification of all possible solutions for a propositional formula. In practice, enumerating all complete models is often infeasible, making the identification of partial models essential for generating a concise representation of the solution set. Deterministic Decomposable Negation Normal Form (d-DNNF) serves as a language for representation known to offer polynomial-time algorithms for model enumeration. Specifically, when a propositional formula is encoded in d-DNNF, it enables iterative model enumeration with
APA, Harvard, Vancouver, ISO, and other styles
2

Dockens, Kim, Shawna Johnston, Marc Demeter, and Stan Leong. "Comparison of Planktonic and Sessile Bacteria Counts Using ATP and DNA Based Methods." In CORROSION 2017. NACE International, 2017. https://doi.org/10.5006/c2017-09414.

Full text
Abstract:
Abstract Microbiologically influenced corrosion (MIC) is a term used to describe corrosive damage to metals caused by microbes. Corrosion damage is costly to operations, the environment and life. As such, monitoring for, and diagnosing MIC as part of a complete corrosion mitigation strategy is of paramount importance. Traditional MIC diagnostic techniques employ culture-based methods aimed at enumerating microbes presumed to be associated with MIC. Culture-based diagnostics are time consuming and may severely under estimate populations. Moreover, microbes mediating corrosion typically exhibit
APA, Harvard, Vancouver, ISO, and other styles
3

Cowan, Jennifer K. "Rapid Enumeration of Sulfate-Reducing Bacteria." In CORROSION 2005. NACE International, 2005. https://doi.org/10.5006/c2005-05485.

Full text
Abstract:
Abstract In oilfield systems, the detection of live bacteria is necessary to evaluate the potential for microbially influenced corrosion (MIC), biogenic souring and to evaluate the effectiveness of biocide treatment programs. Biocide is often over-or under-dosed in the absence of timely data to determine viable bacterial concentration in the target system. Serial dilution into bacterial culture media, the most common method to enumerate viable oilfield bacteria, takes up to 4 weeks to obtain results for the slow-growing sulfate-reducing bacteria (SRB). Direct microscopy is an alternative metho
APA, Harvard, Vancouver, ISO, and other styles
4

Brutinel, Evan, Ben Wilson, and Kristi Gangelhoff. "Evaluation of a Self-contained, Anaerobic Environment-generating Culture Device for Detection of Sulfate-reducing Bacteria." In CORROSION 2019. NACE International, 2019. https://doi.org/10.5006/c2019-13174.

Full text
Abstract:
Absrract Certain classes of microorganisms (e.g., sulfate reducing bacteria or SRB) have been linked to an increased risk of microbiologically influenced corrosion (MIC) and reservoir souring. The ability to quickly and accurately detect and enumerate MIC-associated microbes is an essential part of an informed and efficacious mitigation strategy. Despite advances in molecular microbiology methods (MMMs) and adenosine triphosphate (ATP) detection technologies, culture-based detection remains a key aspect of industrial and oil field microbiology. Detection and enumeration of MIC-causing microbes
APA, Harvard, Vancouver, ISO, and other styles
5

Meghana, K., Shankaramma, M. N. Thippeswamy, A. M. Anu, M. Chaithra, and N. Nagamani. "Enumeration and Post-Enumeration Attack on Active Directory and Their Detection Using log Correlation Method." In 2024 8th International Conference on Computational System and Information Technology for Sustainable Solutions (CSITSS). IEEE, 2024. https://doi.org/10.1109/csitss64042.2024.10817003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

de Colnet, Alexis, and Pierre Marquis. "On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/358.

Full text
Abstract:
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, on
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
Abstract:
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 str
APA, Harvard, Vancouver, ISO, and other styles
8

Jonnalagadda, Srinath, and 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.

Full text
Abstract:
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 resulti
APA, Harvard, Vancouver, ISO, and other styles
9

Yan, Hong-Sen, Feng-Ming Ou, and 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.

Full text
Abstract:
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 t
APA, Harvard, Vancouver, ISO, and other styles
10

Grégoire, Éric, Yacine Izza, and Jean-Marie Lagniez. "Boosting MCSes Enumeration." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/182.

Full text
Abstract:
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 rot
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Enumeraton"

1

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

Full text
Abstract:
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 expre
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
Abstract:
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 probl
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Enumeraton' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography