搜索结果: 61-75 共查到“理学 Complexity”相关记录130条 . 查询时间(0.078 秒)
Complexity, information transfer and collective behavior in chaotic dynamical networks
Chaotic Dynamics (nlin.CD) Adaptation and Self-Organizing Systems (nlin.AO)
2010/11/10
We investigate the relationship between complexity, information transfer and the emergence of collective behaviors, such as synchronization and nontrivial collective behavior, in a network of globally...
Quantum query complexity of minor-closed graph properties
Quantum query minor-closed graph properties
2010/11/8
We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether a graph is planar, is a forest, or does not contain a path of a given length....
Overcoming Problems in the Measurement of Biological Complexity
Overcoming Problems Measurement Biological Complexity
2010/11/10
In a genetic algorithm, fluctuations of the entropy of a genome over time are interpreted as fluctuations of the information that the genome's organism is storing about its environment, being this ref...
Aging is a fundamental aspect of living systems that undergo a progressive deterioration of physiological function with age and an increase of vulnerability to disease and death. Living systems, know...
Complexity Adjusted Soft-Output Sphere Decoding by Adaptive LLR Clipping
Soft-Output Sphere Decoding Adaptive LLR Clipping
2010/11/15
A-posteriori probability (APP) receivers operating over multiple-input, multiple-output channels provide enhanced performance at the cost of increased complexity. However, employing full APP processi...
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding
Throughput Randomized Linear Network Coding
2010/11/22
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, bu...
Quantum Commitments from Complexity Assumptions
Quantum Commitments Complexity Assumptions
2010/11/5
Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and the quantum regime, we need to look at computationally secu...
Why Philosophers Should Care About Computational Complexity
quantum computing omniscience bounded rationality PAC-learning computationalism
2011/9/7
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed c...
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
Optimal Lower Bound Communication Complexity Gap-Hamming-Distance
2010/12/15
We prove an optimal W(n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal multi-pass space lower...
Phase-space characterization of complexity in quantum many-body dynamics
Phase-space characterization complexity quantum many-body dynamics
2010/10/18
We propose a phase-space Wigner harmonics entropy measure for many-body quantum dynamical
complexity. This measure, which reduces to the well known measure of complexity in classical
systems and whi...
Reduced Complexity Decoding for Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding
Complexity Decoding Bit-Interleaved Coded Multiple Beamforming Constellation Precoding
2010/12/8
Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be perfectly known to the transmitter as well as the receiver. Bit-Interleaved Coded Multiple...
Linear Transceiver Design for Interference Alignment: Complexity and Computation
Linear Transceiver Interference Alignment: Complexity Computation
2010/12/8
Consider a MIMO interference channel whereby each transmitter and receiver are equipped with
multiple antennas. The basic problem is to design optimal linear transceivers (or beamformers) that can ma...
Completing Aronov et al.’s study on zero-discrepancymatrices for digital halftoning, we determine all (m, n, k, l) for which it is possible to put mn consecutive integers on an m × n board (with wrap-...
On Complexity of Isoperimetric Problems on Trees
isoperimetric number Cheeger constant normalized cut graph partitioning
2010/12/15
This paper is aimed to investigate some computational aspects of different isoperi-metric problems on weighted trees. In this regard, we consider different connectivity pa-rameters called minimum norm...
Complexity and Stochastic Synchronization in Coupled Map Lattices and Cellular Automata
Complexity Stochastic Synchronization Coupled Map Lattices Cellular Automata
2010/12/15
Nowadays the question ‘what is complexity?’ is a challenge to be answered. This question
is triggering a great quantity of works in the frontier of physics, biology, mathematics and
computer science...