This work introduces a modified MAX MIN Ant System (MMAS) designed to solve the Capacitated pMedians Problem (CPMP). It presents the most relevant steps towards the implementation of an MMAS to solve the CPMP, including some improvements on the original MMAS algorithm, such as the use of a density model in the information heuristics and a local search adapted from the uncapacitated pmedians pro...

BACKGROUND Non-adherence to treatment is an important and often unrecognized risk factor that contributes to reduced control of blood pressure (BP). OBJECTIVE To determine the association between treatment adherence measured by a validated version in Portuguese of the 8-item Morisky Medication Adherence Scale (MMAS-8) and BP control in hypertensive outpatients. METHODS A cross-sectional stu...

The assignments of real time tasks to heterogeneous multiprocessors in real time applications are very difficult in scenarios that require high performance. The main problem in the heterogeneous multiprocessor system is task assignment to the processors because the execution time for each task varies from one processor to another. Hence, the problem of finding a solution for task assignment to ...

The efficient processing of MultiMedia Applications (MMAs) is currently one of the main bottlenecks in the media processing field. Many architectures have been proposed for processing MMAs such as VLIW, superscalar (general-purpose processor enhanced with a multimedia extension such as MMX), vector architectures, SIMD architectures, and reconfigurable computing devices. The question then arises...

Abstract The traveling salesman problem (TSP) is one of typical combinatorial optimization problems. Ant colony (ACO) an effective method to solve the problem, but there are some non-negligible shortcomings hidden in original algorithm. primary objective this research optimize ACO produce quality work throughout solving TSP. To end, hybrid SOS-MMAS algorithm proposed. Concretely, apply advanced...

Parallel algorithms, such as the ant colony algorithm, take a long time when solving large-scale problems. In this paper, the MAX-MIN Ant System algorithm (MMAS) is parallelized to solve Traveling Salesman Problem (TSP) based on a Spark cloud computing platform. We combine MMAS with Spark MapReduce to execute the path building and the pheromone operation in a distributed computer cluster. To im...