In this paper, a hybrid method for solving multi-objective problem has been provided. The proposed method is combining the ε-Constraint and the Cuckoo algorithm. First the multi objective problem transfers into a single-objective problem using ε-Constraint, then the Cuckoo optimization algorithm will optimize the problem in each task. At last the optimized Pareto frontier will be drawn. The adv...

the problem of utilizing undesirable (bad) outputs in dea models often need replacing the assumption of free disposability of outputs by weak disposability of outputs. the kuosmanen technology is the only correct representation of the fully convex technology exhibiting weak disposability of bad and good outputs. also, there are some specific features of non-radial data envelopment analysis (dea...

Focused crawling is an important technique for topical resource discovery on the Web. The key issue in focused crawling is to prioritize uncrawled uniform resource locators (URLs) in the frontier to focus the crawling on relevant pages. Traditional focused crawlers mainly rely on content analysis. Link-based techniques are not effectively exploited despite their usefulness. In this paper, we pr...

Mathematical programming methods dominate in the portfolio optimization problems, but they cannot be used if we introduce a constraint limiting the number of different assets included in the portfolio. To solve this model some of the heuristics methods (such as genetic algorithm, neural networks and particle swarm optimization algorithm) must be used. In this paper we utilize binary particle sw...

Abstract—There are many issues are related with lifetime and coverage in wireless sensor networks (WSNs). We try to locate heterogeneous sensors and route the routing information for minimization of network cost, maximization of network lifetime. We aim at provide better connectivity and coverage among the sensor nodes. For this we propose mathematical formulations and use an optimal solution f...

We present a tree diierence algorithm with expected sequential execution time O(n log log n) and expected parallel execution time of O(log n), for trees of size n. The algorithm assumes unique labels and permits operations only on leaves and frontier subtrees. Despite these limitations, it can be useful in the analysis of structured text.

This paper reports an evolutionary approach called Scatter Search, that uses the concept of Pareto optimality to obtain a good approximate Pareto frontier. In order to designate a subset of strategies to be a reference solutions a choice function called Kramer Selection is used. A variant of measure of Kemen-Snell may be used, in our case study, in order to find a diverse set to complement the ...

We study the percolation threshold for fully penetrable discs by measuring the average location of the frontier for a statistically inhomogeneous distribution of fully penetrable discs. We use two different algorithms to efficiently simulate the frontier, including the continuum analogue of an algorithm previously used for gradient percolation on a square lattice. We find that φc = 0.676 339 ± ...

Proof. We first prove that every free cell accessible from s becomes a frontier at least once. We prove this by induction on the Manhattan distance d of the cells from s. As the base case, consider d = 0. The only cell with d = 0 is s itself, and it is added to the frontier set F in line 3 of OnlineCoverage. We now assume correctness for d = k and prove for d = k + 1. Consider a cell c with dis...

We propose a one-norm support vector machine (SVM) formulation as an alternative to the well-known formulation that uses parameter C in order to balance the two inherent objective functions of the problem. Our formulation is motivated by the ǫ-constraint approach that is used in bicriteria optimization and we propose expressing the objective of minimizing total empirical error as a constraint w...