搜索结果: 1-7 共查到“应用数学 Complexity”相关记录7条 . 查询时间(0.125 秒)
Complexity of minimize total weighted average completion time scheduling problems with release times
flow-shop scheduling problem transportation delays
2010/9/20
The paper considers the problem of scheduling n jobs in a two-machine flow-shop to minimize the weighted sum of completion times. Between the completion of an operation and the beginning of the next o...
Pair-wise Markov Random Fields Applied to the Design of Low Complexity MIMO Detectors
Pair-wise Markov Random Fields Design Low Complexity MIMO Detectors
2010/11/24
Pair-wise Markov random fields (MRF) are considered for application to the development of low complexity, iterative MIMO detection. Specifically, we consider two types of MRF, namely, the fully-conne...
Orientable closed 3-manifolds with surface-complexity one
3-manifolds surface-complexity one
2010/11/23
After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.
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...
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...