搜索结果: 106-120 共查到“理学 Complexity”相关记录130条 . 查询时间(0.109 秒)
On the complexity of non-unique probe selection
Non-unique probe selection Separable matrices DP-complete P
2012/12/3
We investigate the computational complexity of some basic problems regarding non-unique probe selection using separable matrices. In particular, we prove that the minimal d?separable matrix problem is...
Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstructing a dependency graph of bou...
Approximation error bounds via Rademacher's complexity
approximation error model complexity curse of dimension-ality Rademacher's complexity
2010/9/10
Approximation properties of some connectionistic models, commonly used to construct approximation schemes for optimization problems with multivariable functions as admissible solutions, are investigat...
Trade-off between time complexity and makespan for flexible flow-shop group scheduling problems with two machine centers
group scheduling flexible flow shop Johnson algorithm
2010/9/15
The flexible flow-shop group scheduling problem is investigated in this paper to minimize the makespan. Two algorithms have been proposed to solve the problem with two machine centers, which have the ...
The complexity of a minimal subsystem on compact spaces
chaos minimal sub-system topological semi-conjugate
2010/9/16
In this paper , we discuss the complexity of the compact system generated by the continuous map on compact spaces and prove if there exists a topological semi-conjugate which is from the compact space...
In this paper, we prove that there is a natural equivalence between the category ${\scr F}_1(x)$ of Koszul modules of complexity $1$ with filtration of given cyclic modules as the factor modules of an...
We obtain the optimal order of high-dimensional integration complexity in the quantum computation model in anisotropic Sobolev classes $W_{\infty}^{\bf r}([0,1]^d)$ and H$\rm{\ddot{o}}$lder Nikolskii ...
Complexity and approximation of the minimum recombinant haplotype configuration problem
Haplotyping Pedigree Recombinant SNP Complexity Approximation L-reduction Positive result Negative result Bounded
2012/12/3
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant principle (MRHC). F...
The Approximation Complexity of Win-Lose Games
The Approximation Complexity Win-Lose Games
2012/11/29
We further our algorithmic and structural understanding of Nash equilibria.
Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database
quantum algorithm unsorted database search problem quantum query complexity
2007/8/15
2007Vol.48No.2pp.264-266DOI:
Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database
SHANG Bin
School of Computer Science & Technology, ...
Complexity Analysis and Computation of the Optimal Harvesting for One-Species Population Resources
2007/8/7
The exploitation of renewable resources creates many complex problems for culture, ecology and economics as well. Ascertaining the essentials behind the complex problems is very important. In this pap...
BINARY SEQUENCE WITH PERFECT SPREADING STAIRCASE PROFILE OF LINEAR COMPLEXITY
Linear complexity pseudo-random sequenc
2007/8/7
This paper makes the following investigations. 1. To solve the second open problem proposed by M.Morii and M.Kasahar[1]; 2. To prove the nonexistence of PSSP sequence with the smallest(or biggest) den...
Let \underline{S}=(S,S,…) be a binary random sequence with period N=2~n, where S=(S_0,…,S_(N-1)) is its one period with N independent and uniformly distributed binary random variables. The main result...
LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m)
Linear complexity over Z/(m) uniqueness
2007/8/7
In this note we discuss the annihilating properties of sequences over Z/(m). By considering the linear complexity and the annihilator structure, we derive the uniqueness condition for the minimal poly...