the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...

Accurately reconstructing the large-scale gene order in an ancestral genome is a critical step to better understand genome evolution. In this paper, we propose a heuristic algorithm for reconstructing ancestral genomic orders with duplications. The method starts from the order of genes in modern genomes and predicts predecessor and successor relationships in the ancestor. Then a greedy algorith...

We give a distributed one pass streaming algorithm for graph sparsification. Besides producing a sparsifier, our algorithm maintains a hierarchy of UNION-FIND data structures in a distributed manner that efficiently support queries of strong connectivities between pairs of vertices. An important component of the algorithm is an implementation of UNION-FIND queries over an Active Distributed Has...

A method for grid scheduling is proposed to optimize multiple objectives based on ant colony algorithm. Ant colony algorithm is a global optimization method and has the advantages of parallel search and positive feedback. But the algorithm is prone to stagnate or be trapped into a local optimum. This paper introduces the solution space information to improve the performance. The capacity of gri...

considering the increasingly high attention to quality, promoting the reliability of products during designing process has gained significant importance. in this study, we consider one of the current models of the reliability science and propose a non-linear programming model for redundancy allocation in the series-parallel systems according to the redundancy strategy and considering the assump...