This paper considers an economic lot sizing model with constant capacity, non-increasing setup cost and convex inventory cost function algorithms with computational time of O(N x TD(N))have been developed for solving ...
详细信息
This paper considers an economic lot sizing model with constant capacity, non-increasing setup cost and convex inventory cost function algorithms with computational time of O(N x TD(N))have been developed for solving the model, where N is the number of planning periods and TD(N) is the total demand This study partially characterizes the optimal planning structure of the model A new efficient algorithm with computational time of O(N log N) has also been developed based on the partial optimal structure Moreover computational study demonstrates that the new algorithm is efficient (C) 2010 Elsevier Ltd All rights reserved
A pedestrian detection algorithm based on an analysis of the autocorrelation function of a seismic signal is proposed. The efficiency of this method in terms of detection and false alarm probabilities is shown. Approa...
详细信息
A pedestrian detection algorithm based on an analysis of the autocorrelation function of a seismic signal is proposed. The efficiency of this method in terms of detection and false alarm probabilities is shown. Approaches to reducing the complexity of the proposed algorithm are considered. A comparative study is made of the effects of the point sampling frequency and the method of calculating the autocorrelation function on the performance and complexity of the pedestrian detection algorithm.
Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directed-acyclic graphs (DAGs). Scheduling refe...
详细信息
Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directed-acyclic graphs (DAGs). Scheduling refers to the assignment of these parallel tasks on a set of bounded heterogeneous processors connected by high speed networks. Since task assignment is an NP-complete problem, instead of finding an exact solution, scheduling algorithms are developed based on heuristics, with the primary goal of minimizing the overall execution time of the application or schedule length. In this paper, the overall execution time (schedule length) of the tasks is reduced using task duplication on top of the Critical-Path-On-a-Processor (CPOP) algorithm.
In this paper, a novel feature selection method of discernibility object pair set is provided. At first, the feature selection definition of new method is presented. What's more, it is proved that the above featur...
详细信息
ISBN:
(纸本)9783642242816;9783642242823
In this paper, a novel feature selection method of discernibility object pair set is provided. At first, the feature selection definition of new method is presented. What's more, it is proved that the above feature selection definition is equal to the feature selection definition based on conditional information entropy. In order to compute discernibility object pair set, a quick algorithm for simplified decision system is introduced, whose time complexity is O(vertical bar C parallel to U vertical bar). On this condition, an efficient and novel algorithm based on discernibility object pair set for feature selection in conditional information entropy model is designed, whose time and space complexity are O(vertical bar C parallel to U vertical bar)+ O(vertical bar C parallel to U/C vertical bar(2)) and O(vertical bar U/C vertical bar(2))+O(vertical bar U vertical bar) respectively. At last, an example is employed to illustrate the efficiency of the new algorithm.
The time complexity of B algorithm, one of the intelligent search algorithms, is discussed. By anatomizing some instances, it is pointed out that the cost of calculating the value of heuristic function should be inclu...
详细信息
ISBN:
(纸本)9780878492879
The time complexity of B algorithm, one of the intelligent search algorithms, is discussed. By anatomizing some instances, it is pointed out that the cost of calculating the value of heuristic function should be included in the range of time complexity analysis for B algorithm. And then, an algorithm of calculating the value of heuristic function is presented. By analyzing the cost of calculating the value of heuristic function, it is pointed out that the number of recursions in B algorithm is O(n!) in the worst case. Therefore, the time complexity of B algorithm is exponential instead of O(n(2)).
In this paper, we obtain an efficient separability criterion for bipartite quantum pure state systems, which is based on the two-order minors of the coefficient matrix corresponding to quantum state. Then, we generali...
详细信息
In this paper, we obtain an efficient separability criterion for bipartite quantum pure state systems, which is based on the two-order minors of the coefficient matrix corresponding to quantum state. Then, we generalize this criterion to multipartite arbitrarily dimensional pure states. Our criterion is directly built upon coefficient matrices, but not density matrices or observables, so it has the advantage of being computed easily. Indeed, to judge separability for an arbitrary n-partite pure state in a d-dimensional Hilbert space, it only needs at most O(d) times operations of multiplication and comparison. Our criterion can be extended to mixed states. Compared with Yu's criteria, our methods are faster, and can be applied to any quantum state.
The BQ mode of MPEG-4's visual texture coding has adopted Predicative Embedded Zero-tree Wavelet Coding algorithm(PEZW).Although in PEZW there is the germ of linear indexing technique,it hasn't completely impl...
详细信息
The BQ mode of MPEG-4's visual texture coding has adopted Predicative Embedded Zero-tree Wavelet Coding algorithm(PEZW).Although in PEZW there is the germ of linear indexing technique,it hasn't completely implemented the ***,its algorithm is more complex,and its coding speed is *** this,this paper has applied linear indexing technique to improving PEZW,reducing the complexity of the algorithm and improving the coding speed of the algorithm greatly.
We describe herein the results of implementing an algorithm for syntactic pattern recognition using the concept of Finite Inductive Sequences (FI). We discuss this idea, and then provide a big 0 estimate of the time t...
详细信息
ISBN:
(纸本)9783642160004
We describe herein the results of implementing an algorithm for syntactic pattern recognition using the concept of Finite Inductive Sequences (FI). We discuss this idea, and then provide a big 0 estimate of the time to execute for the algorithms. We then provide some empirical data to support the analysis of the timing. This timing is critical if one wants to process millions of symbols from multiple sequences simultaneously. Lastly, we provide an example of the two FI algorithms applied to actual data taken from a gene and then describe some results as well as the associated data derived from this example.
A novel molecular computing model based on circular DNA was developed to solve a 3-coloring graph problem. This computing model uses circular DNA and works as to dial a number. The method of selecting true solutions i...
详细信息
A novel molecular computing model based on circular DNA was developed to solve a 3-coloring graph problem. This computing model uses circular DNA and works as to dial a number. The method of selecting true solutions is similar to dialing on a telephone. Moreover, the key methods in this model were circularization of single single-strand DNA (ssDNA) molecules and a backtracking deletion algorithm. In the course of computing, the structure of the DNA molecule was transformed into linear double-strand DNA (dsDNA), linear ssDNA, and circular ssDNA. For a 3-coloring graph problem with n vertices, the algorithm time complexity and the space complexity are both O(n(2)) at most. The computing achievement by this model indicates that circular DNA has extensive applications in molecular computing research.
The paper describes an algorithm that constructs approximate decision trees (alpha-decision trees), which are optimal relatively to one of the following complexity measures: depth, total path length or number of nodes...
详细信息
ISBN:
(纸本)9783642135286
The paper describes an algorithm that constructs approximate decision trees (alpha-decision trees), which are optimal relatively to one of the following complexity measures: depth, total path length or number of nodes. The algorithm uses dynamic programming and extends methods described in [4] to constructing approximate decision trees. Adjustable approximation rate allows controlling algorithm complexity. The algorithm is applied to build optimal alpha-decision trees for two data sets from UCI Machine Learning Repository [1].
暂无评论