Results 21 to 30 of about 1,402,894 (317)
A Computational Turn in Policy Process Studies: Coevolving Network Dynamics of Policy Change
Complexity, 2022 The past three decades of policy process studies have seen the emergence of a clear intellectual lineage with regard to complexity. Implicitly or explicitly, scholars have employed complexity theory to examine the intricate dynamics of collective action ...
Maxime Stauffer +5 more
doaj +1 more source
Boundaries of computational complexity and optimal cluster’s quantity for controlled swarm in non-cooperative games [PDF]
Известия высших учебных заведений: Прикладная нелинейная динамика, 2021 The purpose of the work is to determine the relationship between the computational complexity of controlling a swarm of particles and the available computational resources for choosing the optimal control strategy.
Kiselev, Oleg Михайлович
doaj +1 more source
The Computational Complexity of Plethysm Coefficients [PDF]
Computational Complexity, 2020 In two papers, Bürgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) to prove lower bounds on the border rank of the matrix multiplication ...
N. Fischer, Christian Ikenmeyer
semanticscholar +1 more source
Study of blockchain's consensus mechanism based on score
IET Blockchain, 2021 The consensus mechanism is a key technology to achieve state consistency among distributed nodes and it determines the consensus efficiency and stability of the blockchain system.
Shaobin Cai +3 more
doaj +1 more source
Diameter constrained reliability of ladders and Spanish fans [PDF]
Yugoslav Journal of Operations Research, 2016 We are given a graph G = (V, E), terminal set K V and diameter d > 0. Links fail stochastically and independently with known probabilities. The diameter-constrained reliability (DCR for short), is the probability that the K-diameter is not ...
Cancela Héctor +3 more
doaj +1 more source
Computational Complexity Theory and the Philosophy of Mathematics†
Philosophia Mathematica, 2019 Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e.,
Walter Dean
semanticscholar +1 more source
Ray tracing — computing the incomputable? [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We recall from previous work a model-independent framework of computational complexity theory. Notably for the present paper, the framework allows formalization of the issues of precision that present themselves when one considers physical, error-prone ...
Ed Blakey
doaj +1 more source
Bosons vs. Fermions – A computational complexity perspective [PDF]
Revista Brasileira de Ensino de FísicaRecent years have seen a flurry of activity in the fields of quantum computing and quantum complexity theory, which aim to understand the computational capabilities of quantum systems by applying the toolbox of computational complexity theory. This paper
Daniel Jost Brod
doaj +2 more sources
Optimizing the Constrained Estimate of Random Walks
IEEE Access, 2018 We introduce the problem of optimizing the constrained estimate of random walks on the probability networks (which are formally defined as the weighted directed graphs in which the total outgoing weight of any node is at most 1).
Rong Zhou, Yong Zhang, Li Ning
doaj +1 more source
Models of Computer Calculations
Кібернетика та комп'ютерні технології, 2022 Introduction. The complexity of computational algorithms for solving typical problems of computational, applied, and discrete mathematics is analyzed from the perspective of the theory of computation, depending on the computer architecture and the used ...
Valerii Zadiraka +2 more
doaj +1 more source