Results 61 to 70 of about 4,693,176 (171)
On Parameterized Exponential Time Complexity
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Jianer, Kanj, Iyad A., Xia, Ge
openaire +1 more source
IEEE Access, 2020 Software Defined Networking (SDN) presents a tremendous opportunity for developing abstract management of network updates. However, network updates introduce challenges in terms of consistency. Many consistent update algorithms are proposed for Ethernet,
Jun Lu +4 more
doaj +1 more source
Online algorithms for scheduling transactions on python software transactional memory [PDF]
Serbian Journal of Electrical Engineering, 2019 Designing online transaction scheduling algorithms is challenging because one needs to reconcile three opposing requirements: (i) they should be fast, (ii) they should minimize make span and maximize throughput, and (iii) they should produce ...
Popović Marko +3 more
doaj +1 more source
Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity
, 2007 The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary matrices. For
Rajan, B. Sundar, Rajan, G. Susinder
core +1 more source
IEEE AccessRobust Intrusion Detection Systems (IDS) are increasingly necessary in the age of big data due to the growing volume, velocity, and variety of data generated by modern networks.
Aganith Shanbhag +4 more
doaj +1 more source
The Complexity of Mean Flow Time Scheduling Problems with Release Times
, 2006 We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time.
Baptiste, Philippe +5 more
core +3 more sources
Path Independence in Adiabatic Quantum Computing for Hadamard Gate
Journal of Mathematical and Fundamental Sciences, 2014 The computation time in adiabatic quantum computing (AQC) is determined by the time limit of the adiabatic evolution, which in turn depends on the evolution path. In this research we have used the variational method to find an optimized path.
Jusak Sali Kosasih +2 more
doaj +1 more source
Real-time logics: complexity and expressiveness
[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, 1993 The authors consider the theory of timed state sequences which combines classical theory of infinite state sequences with a theory of discrete time, via a monotonic function that maps every state to its time. This is suitable for reasoning about real-time temporal systems.
Alur, R., Henzinger, T.A.
openaire +1 more source
The Computational Complexity of Estimating Convergence Time [PDF]
, 2010 An important problem in the implementation of Markov Chain Monte Carlo algorithms is to determine the convergence time, or the number of iterations before the chain is close to stationarity. For many Markov chains used in practice this time is not known.
Bhatnagar, Nayantara +2 more
core
, 2013 We study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods.
Boland, Natashia +3 more
core +1 more source