Results 51 to 60 of about 21,948 (228)
A knowledge-based system with learning for computer communication network design [PDF]
, 1990 Computer communication network design is well-known as complex and hard. For that reason, the most effective methods used to solve it are heuristic. Weaknesses of these techniques are listed and a new approach based on artificial intelligence for solving
Hoang, Hai Hoc +2 more
core +2 more sources
Quantum Zero-Error Algorithms Cannot be Composed [PDF]
, 2002 We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-error. This shows that quantum zero-error algorithms cannot be composed. In
Buhrman, Harry, de Wolf, Ronald
core +4 more sources
The language of certain conflicts of a nondeterministic process [PDF]
, 2010 The language of certain conflicts is the most general set of behaviours of a nondeterministic process, which certainly lead to a livelock or deadlock when accepted by another process running in parallel.
Malik, Robi
core +1 more source
Reachability in Higher-Order-Counters
, 2013 Higher-order counter automata (\HOCS) can be either seen as a restriction of higher-order pushdown automata (\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels.
A. Bouajjani +11 more
core +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
Complexity, 2020 This paper investigates access link control and resource allocation for the device-to-device (D2D) communication in the fifth generation (5G) cellular networks.
Ning Du +3 more
doaj +1 more source
Reducing Nondeterministic Tree Automata by Adding Transitions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We introduce saturation of nondeterministic tree automata, a technique that consists of adding new transitions to an automaton while preserving its language.
Ricardo Manuel de Oliveira Almeida
doaj +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
Byzantine Fault Tolerance for Nondeterministic Applications
, 2007 All practical applications contain some degree of nondeterminism. When such applications are replicated to achieve Byzantine fault tolerance (BFT), their nondeterministic operations must be controlled to ensure replica consistency.
Zhao, Wenbing
core +4 more sources
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