Sciweavers

13376 search results - page 217 / 2676
» Problem Solving with
Sort
View
AINA
2003
IEEE
15 years 7 months ago
Signature Schemes Based on Two Hard Problems Simultaneously
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang
148
Voted
ARCS
2004
Springer
15 years 9 months ago
Ant Colony Optimization for dynamic Traveling Salesman Problems
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
Carlos A. Silva, Thomas A. Runkler
ENGL
2007
121views more  ENGL 2007»
15 years 3 months ago
A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
—Genetic Algorithms (GA) and Evolutionary Programming (EP) are two well-known optimization methods that belong to the class of Evolutionary Algorithms (EA). Both methods have gen...
Raymond Chiong, Ooi Koon Beng
136
Voted
JVA
2006
IEEE
15 years 9 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
INFORMATICALT
2006
77views more  INFORMATICALT 2006»
15 years 3 months ago
Parallel Numerical Algorithms for 3D Parabolic Problem with Nonlocal Boundary Condition
Three parallel algorithms for solving the 3D problem with nonlocal boundary condition are considered. The forward and backward Euler finite-difference schemes, and LOD scheme are t...
Raimondas Ciegis