Results 61 to 70 of about 4,855,672 (239)
From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and lower
Hermann Gruber, Markus Holzer
doaj +1 more source
Journal of Economics &Management Strategy, EarlyView.ABSTRACT For privately held startups, restructuring ownership is challenging due to diverse and uncertain valuations among owners. Traditional approaches, including the BMBY mechanism for equal partnerships, fail to address the complexities of multi‐owner settings and do not elicit true valuations.
Gal Danino, Moran Koren, Omer Madmon
wiley +1 more source
A Hybrid Genetic Algorithm/Simulation Approach for Redundancy Optimization with Objective of Maximizing Mean Lifetime and Considering Component Selection [PDF]
International Journal of Research in Industrial Engineering, 2013 In this paper, we consider a reliability redundancy optimization problem in a series-parallel type system employing the redundancy strategy of cold-standby.
H. Karimi, A.A. Najafi
doaj
FPT is Characterized by Useful Obstruction Sets [PDF]
, 2013 Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one way of ...
Fellows, Michael R., Jansen, Bart M. P.
core +1 more source
Journal of Product Innovation Management, EarlyView.ABSTRACT Artificial intelligence (AI) technologies have gained significance for all types of firms, including family firms. However, unlike other business contexts, family firms face unique challenges in adopting complex and generative technologies, such as AI.
Jonas Soluk +2 more
wiley +1 more source
A Divide-and-Conquer Evolutionary Algorithm for Large-Scale Virtual Network Embedding
IEEE Transactions on Evolutionary Computation, 2020 The subgraph isomorphism problems, which aim to map subgraphs to a given graph, are widely seen in many applications and are usually nondeterministic polynomial-time complete (NP-complete).
An Song +4 more
semanticscholar +1 more source
Solving One-Dimensional Cutting Stock Problems with the Deep Reinforcement Learning
Mathematics, 2023 It is well known that the one-dimensional cutting stock problem (1DCSP) is a combinatorial optimization problem with nondeterministic polynomial (NP-hard) characteristics.
Jie Fang +3 more
doaj +1 more source
Reachability testing algorithm for parallel program in heterogeneous network environment
Tongxin xuebao, 2006 Orienting to difficulty of testing nondeterministic parallel programs,the relationship between message-passing behavior and network performance constraint in grid environment was analyzed,and a new limited reachability testing algorithm was proposed ...
WANG Wei1, DU Cui-lan2, ZHANG Hong-li1
doaj +2 more sources
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages [PDF]
, 2007 The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the
Glasser, Christian +2 more
core +7 more sources
Functional Sieve Bootstrap for the Partial Sum Process With an Application to Change‐Point Detection
Journal of Time Series Analysis, EarlyView.ABSTRACT This article applies the functional sieve bootstrap (FSB) to estimate the distribution of the partial sum process for time series stemming from a weakly stationary functional process. Consistency of the FSB procedure under weak assumptions on the underlying functional process is established.
Efstathios Paparoditis +2 more
wiley +1 more source