Results 81 to 90 of about 1,491,574 (265)
A Computable Economist’s Perspective on Computational Complexity [PDF]
A computable economist.s view of the world of computational complexity theory is described. This means the model of computation underpinning theories of computational complexity plays a central role.
K. Vela Velupillai
core
Complexity growth and shock wave geometry in AdS-Maxwell-power-Yang–Mills theory
European Physical Journal C: Particles and Fields, 2018 We study effects of non-abelian gauge fields on the holographic characteristics for instance the evolution of computational complexity. To do so we choose Maxwell-power-Yang–Mills theory defined in the AdS space-time. Then we seek the impact of charge of
Emad Yaraie +2 more
doaj +1 more source
The Complexity of Planning Revisited - A Parameterized Analysis [PDF]
, 2012 The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (Baeckstroem and Nebel) have influenced following research in planning in many ways. We go back and reanalyse their subclasses,
Baeckstroem, Christer +4 more
core
, 2010 To reduce computational complexity and delay in randomized network coded content distribution, and for some other practical reasons, coding is not performed simultaneously over all content blocks, but over much smaller, possibly overlapping subsets of ...
Li, Yao +2 more
core +1 more source
An Optimized Differential Step-Size LMS Algorithm
Algorithms, 2019 Adaptive algorithms with differential step-sizes (related to the filter coefficients) are well known in the literature, most frequently as “proportionate” algorithms. Usually, they are derived on a heuristic basis. In this paper, we introduce
Alexandru-George Rusu +3 more
doaj +1 more source
Common Agency and Computational Complexity: Theory and Experimental Evidence [PDF]
In a common agency game, several principals try to influence the behavior of an agent. Common agency games typically have multiple equilibria. One class of equilibria, called truthful, has been identified by Bernheim and Whinston and has found widespread
Kirchsteiger, G., Prat, A.
core +1 more source
Fast deconvolution method for angular super-resolution imaging based on sub-space embedding
The Journal of Engineering, 2019 This study presents a fast deconvolution method based on the sub-space embedding for angular super-resolution in radar forward-looking imaging area. The ill-posed character of convolution matrix causes the difficulty to improve angular resolution and the
Yang Wu +3 more
doaj +1 more source
The Complexity of Manipulating $k$-Approval Elections [PDF]
, 2011 An important problem in computational social choice theory is the complexity of undesirable behavior among agents, such as control, manipulation, and bribery in election systems. These kinds of voting strategies are often tempting at the individual level
Lin, Andrew
core
String-Based Methods in Perturbative Gravity
, 1993 String theory implies a relatively modest growth in computational complexity for perturbative gravity calculations as compared to gauge theory calculations, contrary to field theory expectations.
't Hooft +41 more
core +1 more source
Provable conditions in computational complexity theory [PDF]
Bulletin of the Australian Mathematical Society, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources