Suchergebnisse - "Enumeration algorithm"

Andere Suchmöglichkeiten:

  1. 1

    An implicit enumeration algorithm for the hub interdiction median problem with fortification von Ghaffarinasab, Nader, Atayi, Reza

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Elsevier B.V 16.05.2018
    Veröffentlicht in European journal of operational research (16.05.2018)
    “… •An exact implicit enumeration algorithm is proposed to solve the problem.•Large-scale problem instances are solved using the proposed algorithm …”
    Volltext
    Journal Article
  2. 2

    A Fast and Exact Motif Enumeration Algorithm for Dynamic Networks von Al-Thaedan, Abbas

    ISBN: 9798728265375
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2020
    “… From social to biological networks, prior research in complex networks have demonstrated the importance of the frequency and distribution of different types of …”
    Volltext
    Dissertation
  3. 3

    A Zero-Suppressed Binary Decision Diagram Approach for Constrained Path Enumeration von Tan, Renzo, Kawahara, Jun, Garciano, Agnes, Sin, Immanuel

    ISSN: 2078-0958, 2078-0966
    Veröffentlicht: Hong Kong International Association of Engineers 03.07.2019
    Veröffentlicht in Lecture notes in engineering and computer science (03.07.2019)
    “… Combinatorial optimization over graphs has been the subject of research. Recently, the solution of such problems by enumeration using a compact data structure called the zero-suppressed binary decision diagram was proposed and studied …”
    Volltext
    Journal Article
  4. 4

    Optimal condition-based opportunistic maintenance policy for two-component systems considering common cause failure von Li, Meiyan, Wu, Bei

    ISSN: 0951-8320, 1879-0836
    Veröffentlicht: Elsevier Ltd 01.10.2024
    Veröffentlicht in Reliability engineering & system safety (01.10.2024)
    “… This paper introduces a maintenance optimization model designed for a system comprising two distinct components that are arranged in series and susceptible to …”
    Volltext
    Journal Article
  5. 5

    A set of efficient heuristics and metaheuristics to solve a two-stage stochastic bi-level decision-making model for the distribution network problem von Hajiaghaei-Keshteli, Mostafa, Fathollahi-Fard, Amir Mohammad

    ISSN: 0360-8352, 1879-0550
    Veröffentlicht: Elsevier Ltd 01.09.2018
    Veröffentlicht in Computers & industrial engineering (01.09.2018)
    “… On the other hand, uncertainty is one of important and challenging subjects in distribution networks …”
    Volltext
    Journal Article
  6. 6

    Robust Bayesian cluster enumeration based on the t distribution von Teklehaymanot, Freweyni K., Muma, Michael, Zoubir, Abdelhak M.

    ISSN: 0165-1684, 1872-7557
    Veröffentlicht: Elsevier B.V 01.05.2021
    Veröffentlicht in Signal processing (01.05.2021)
    “… •Penalty term without asymptotic approximations derived for finite sample sizes.•Two-step robust clustering and enumeration algorithm proposed …”
    Volltext
    Journal Article
  7. 7

    Bandit algorithms for policy learning: methods, implementation, and welfare-performance von Kitagawa, Toru, Rowley, Jeff

    ISSN: 1352-4739, 1468-5876
    Veröffentlicht: Singapore Springer Nature Singapore 01.07.2024
    Veröffentlicht in Japanese economic review (Oxford, England) (01.07.2024)
    “… —is a commonly assumed framework of policy learning. An arguably more realistic but challenging scenario is a dynamic setting in which the planner performs experimentation and exploitation simultaneously with subjects that arrive sequentially …”
    Volltext
    Journal Article
  8. 8

    Linear precoding for spatially correlated multiple-input single-output wiretap channel von Hajimomeni, Mona, Aghaeinia, Hassan

    ISSN: 1751-8628, 1751-8636
    Veröffentlicht: The Institution of Engineering and Technology 26.03.2015
    Veröffentlicht in IET communications (26.03.2015)
    “… ). Specifically, two problems are considered. First, a precoder matrix is designed to minimise the average transmitted power subject to QoS requirements at Bob and Eve …”
    Volltext
    Journal Article
  9. 9

    Optimal crashworthiness design of a spot-welded thin-walled hat section von Xiang, Yujiang, Wang, Qian, Fan, Zijie, Fang, Hongbing

    ISSN: 0168-874X, 1872-6925
    Veröffentlicht: Elsevier B.V 01.06.2006
    Veröffentlicht in Finite elements in analysis and design (01.06.2006)
    “… In automotive industry, crashworthiness design is of special interest to ensure passengers safety and reduce vehicle costs. Thin-walled beams are the main …”
    Volltext
    Journal Article
  10. 10

    A revised Taha's algorithm for polynomial 0-1 programming von Wang, J., Li, D., Sun, X. L.

    ISSN: 0233-1934, 1029-4945
    Veröffentlicht: Philadelphia Taylor & Francis Group 01.10.2007
    Veröffentlicht in Optimization (01.10.2007)
    “… This article considers an extended version of the Taha's method for general polynomial 0-1 programming problems and presents an efficient implicit enumeration algorithm by systematically …”
    Volltext
    Journal Article
  11. 11

    Advanced results in enumeration of hyperfields von Ameri, R., Eyvazi, M., Hoskova-Mayerova, S.

    ISSN: 2473-6988, 2473-6988
    Veröffentlicht: AIMS Press 01.01.2020
    Veröffentlicht in AIMS mathematics (01.01.2020)
    “… The purpose of this paper is to introducing a computational method to construction and classification of finite hyperfields (in the sense of Krasner). In this …”
    Volltext
    Journal Article
  12. 12

    Frequent Pattern Mining in Multiple Trajectories of Football Players von Suzuki, Yuto, Ozaki, Tomonobu

    ISSN: 2078-0958, 2078-0966
    Veröffentlicht: Hong Kong International Association of Engineers 14.03.2018
    Veröffentlicht in Lecture notes in engineering and computer science (14.03.2018)
    “… A pattern enumeration algorithm is then applied to the obtained interval-based events with a consideration of the order of events, the time difference and the spatial spread of subtrajectories …”
    Volltext
    Journal Article
  13. 13

    A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology von Burton, Benjamin A., Ozlen, Melih

    ISSN: 0178-4617, 1432-0541
    Veröffentlicht: New York Springer-Verlag 01.04.2013
    Veröffentlicht in Algorithmica (01.04.2013)
    “… In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double description paradigm …”
    Volltext
    Journal Article
  14. 14

    Inverse Optimization, Incentive Design and Healthcare Policy von Siddiq, Auyon

    ISBN: 0438323939, 9780438323933
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2018
    “… This dissertation presents mathematical models and algorithms that draw from optimization and statistics and are motivated by practical problems in operations …”
    Volltext
    Dissertation
  15. 15

    Labeled Subgraph Entropy Kernel von Sun, Chengyu, Xing Ai, Zhang, Zhihong, Hancock, Edwin R

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 21.03.2023
    Veröffentlicht in arXiv.org (21.03.2023)
    “… We design a dynamic programming subgraph enumeration algorithm, which effectively reduces the time complexity …”
    Volltext
    Paper
  16. 16

    The Optimal Selection of Small Portfolios von Blog, B, van der Hoek, G, Rinnooy Kan, A. H. G, Timmer, G. T

    ISSN: 0025-1909, 1526-5501
    Veröffentlicht: Linthicum INFORMS 01.07.1983
    Veröffentlicht in Management science (01.07.1983)
    “… An optimal portfolio subject to a size constraint can be found by an implicit enumeration algorithm, that is much faster than a previous approach and moreover allows the inclusion of securities whose β …”
    Volltext
    Journal Article
  17. 17

    Optimum Allocation of Processes in a Distributed Environment: A Process-to-Process Approach von Sofianopoulou, Stella

    ISSN: 0160-5682, 1476-9360
    Veröffentlicht: London Taylor & Francis 01.04.1990
    Veröffentlicht in The Journal of the Operational Research Society (01.04.1990)
    “… ) of identical processors in a telecommunications environment is examined. The objective is to minimize the total message-passing between processes residing on different processors subject to constraints on the processing power and storage c apacity …”
    Volltext
    Journal Article
  18. 18

    A tree traversal algorithm for decision problems in knot theory and 3-manifold topology von Burton, Benjamin A, Ozlen, Melih

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 30.03.2012
    Veröffentlicht in arXiv.org (30.03.2012)
    “… In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double description paradigm …”
    Volltext
    Paper
  19. 19

    Robust Bayesian Cluster Enumeration Based on the \(t\) Distribution von Teklehaymanot, Freweyni K, Muma, Michael, Zoubir, Abdelhak M

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 05.05.2020
    Veröffentlicht in arXiv.org (05.05.2020)
    “… In real-world applications, the observed data is often subject to heavy tailed noise and outliers which obscure the true underlying structure of the data …”
    Volltext
    Paper
  20. 20

    Dynamic Set Intersection von Kopelowitz, Tsvi, Pettie, Seth, Porat, Ely

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 05.05.2015
    Veröffentlicht in arXiv.org (05.05.2015)
    “… } +t)\) expected time, where \(m=|E|\) and \(\alpha\) is the arboricity of \(G\). This improves a 30-year old triangle enumeration algorithm of Chiba and Nishizeki running in \(O(m \alpha)\) time …”
    Volltext
    Paper