We propose a novel multi-region segmentation approach through a partially-ordered ports (POP) model to segment myocardial scar tissue solely from 3D cardiac delayed-enhancement MR images (DE-MRI). The algorithm makes use of prior knowledge of anatomical spatial consistency and employs customized label ordering to constrain the segmentation without prior knowledge of geometric representation. Th...

The Grouping Genetic Algorithm (GGA) is a Genetic Algorithm heavily modified to suit the structure of grouping problems. Those are the problems where the aim is to find a good partition of a set, or to group together the members of the set. The Bin Packing Problem (BPP) is a well known NP-hard grouping problem items of various sizes have to be grouped inside bins of fixed capacity. On the other...

This paper proposes the design of robust transceivers with Tomlinson-Harashima precoding (THP) for multipleinput multiple-output (MIMO) relay systems with amplify-andforward (AF) protocols based on a multi-branch (MB) strategy. The MB strategy employs successive interference cancellation (SIC) on several parallel branches which are equipped with different ordering patterns so that each branch p...

The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...

planning robot trajectory is a complex task that plays a significant role in design and application of robots in task space. the problem is formulated as a trajectory optimization problem which is fundamentally a constrained nonlinear optimization problem. open-loop optimal control method is proposed as an approach for trajectory optimization of cable parallel manipulator for a given two-end-po...

Given a set S of integers whose sum is zero, consider the problem of finding a permutation of these integers such that: (i) all prefixes of the ordering are non-negative, and (ii) the maximum value of a prefix sum is minimized. Kellerer et al. referred to this problem as the stock size problem and showed that it can be approximated to within 3/2. They also showed that an approximation ratio of ...

We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on the JOQR phase and develop optimization algorithms that account for communication as well as computation costs. Using a model based on representing the partitioning of data as a color, we devise an efficient algorithm fo...

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

This paper proposes the design of robust transceivers with Tomlinson-Harashima precoding (THP) for multipleinput multiple-output (MIMO) relay systems with amplify-andforward (AF) protocols based on a multi-branch (MB) strategy. The MB strategy employs successive interference cancellation (SIC) on several parallel branches which are equipped with different ordering patterns so that each branch p...

Given a graph G, the longest path problem asks to compute a simple path of G with the largest number of vertices. This problem is the most natural optimization version of the well-known and well-studied Hamiltonian path problem, and thus it is NP-hard on general graphs. However, in contrast to the Hamiltonian path problem, there are only a few restricted graph families, such as trees, and some ...