An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

In this paper we present a method for the unsupervised clustering of high-dimensional binary data, with a special focus on electronic healthcare records. We present a robust and efficient heuristic to face this problem using tensor decomposition. We present the reasons why this approach is preferable for tasks such as clustering patient records, to more commonly used distance-based methods. We ...

a new meta-heuristic method, based on neuronal communication (nc), is introduced in this article. the neuronal communication illustrates how data is exchanged between neurons in neural system. actually, this pattern works efficiently in the nature. the present paper shows it is the same to find the global minimum. in addition, since few numbers of neurons participate in each step of the method,...

Multiple Sequences Alignment (MSA) of biological sequences is a fundamental problem in computational biology due to its critical significance in wide ranging applications including haplotype reconstruction, sequence homology, phylogenetic analysis, and prediction of evolutionary origins. The MSA problem is considered NP-hard and known heuristics for the problem do not scale well with increasing...

1 A Dantzig-Wolfe Decomposition-Based Heuristic for Off-line Capacity Calibration of Dynamic Traffic Assignment / D.-Y. Lin. V. Vatsaraj, S.T. Waiter 16 Influence of Demand Uncertainty and Correlations on Traffic Predictions and Decisions / J.C. Duthie.A. Unnikrishnan, S.T. Waiter 30 Peak Ground Acceleration Estimation by Linear and Nonlinear Models with Reduced Order Monte Carlo Simulation / K...

The problem of the distribution of dairy products, which is classified as a combinatorial optimization problem, cannot be solved in polynomial time. In this paper, an algorithm based on Ant Colony Hybrid meta-heuristic system and Geographic Information System (GIS) was used to find a near-optimal solution to this problem. Using the former method, the nearest neighbor heuristic algorithm was use...

Automatic mashup aims to discover desired mashlets according to user goals automatically and combine them into an entirely new application. However, the user goals are usually high-level and coarse-grained while the mashlets are low-level and fine-grained. How to fill in the gap becomes a challenge when addressing automatic mashup development. This paper proposes a novel goal decomposition and ...