Sciweavers

16091 search results - page 258 / 3219
» Solving
Sort
View
ISPDC
2005
IEEE
16 years 4 days ago
New Challenges in Parallel Optimization
: Optimization is a healthy field targeted to find efficient solutions and algorithms to solve problems either in the academia and the industry. As the solved problems became harde...
Enrique Alba
SACRYPT
2001
Springer
110views Cryptology» more  SACRYPT 2001»
15 years 11 months ago
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
Fabian Kuhn, René Struik
IPPS
1999
IEEE
15 years 10 months ago
Parallel Ant Colonies for Combinatorial Optimization Problems
Abstract. Ant Colonies AC optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies...
El-Ghazali Talbi, Olivier Roux, Cyril Fonlupt, Den...
CEC
2005
IEEE
15 years 8 months ago
DynDE: a differential evolution for dynamic optimization problems
Abstract- This paper presents an approach of using Differential Evolution (DE) to solve dynamic optimization problems. Careful setting of parameters is necessary for DE algorithms ...
Rui Mendes, Arvind S. Mohais
SIAMJO
2000
116views more  SIAMJO 2000»
15 years 6 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell