238 search results - page 39 / 48 » Parallel Ant Colonies for Combinatorial Optimization Problem... |
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
CEC
2003
IEEE
14 years 24 days ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
ISSAC
1992
Springer
13 years 11 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
HPDC
2000
IEEE
13 years 12 months ago
2000
IEEE
We describe MW – a software framework that allows users to quickly and easily parallelize scientific computations using the master-worker paradigm on the computationalgrid. MW ...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...