832 search results - page 134 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
GPEM
2002
14 years 9 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
99
Voted
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
We present the design and implementation of new inexact Newton type Bundle Adjustment algorithms that exploit hardware parallelism for efficiently solving large scale 3D scene re...
MASCOTS
2007
2007
A Novel Flow Control Scheme for Best Effort Traffic in NoC Based on Source Rate Utility Maximization
14 years 11 months ago
—Advances in semiconductor technology, has enabled designers to put complex, massively parallel multiprocessor systems on a single chip. Network on Chip (NoC) that supports high ...
88
Voted
EMO
2006
Springer
15 years 1 months ago
2006
Springer
1 In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optim...