832 search results - page 31 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
164
click to vote
PPAM
2007
Springer
16 years 18 hour ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
152
click to vote
NETWORKS
2008
15 years 5 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
133
click to vote
TVLSI
2008
15 years 5 months ago
2008
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
185
click to vote
CP
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
144
click to vote
IPPS
2009
IEEE
16 years 16 days ago
2009
IEEE
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...