4488 search results - page 149 / 898 » Focusing Search by Using Problem Solving Experience |
140
Voted
AAECC
2006
Springer
15 years 3 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
101
Voted
IBERAMIA
1998
Springer
15 years 7 months ago
1998
Springer
In this article we analyze the problem of searching the WWW, giving some insight and models to understand its complexity. Then we survey the two main current techniques used to se...
107
Voted
COR
2006
15 years 3 months ago
2006
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
109
Voted
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
121
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Many real-world optimization problems are dynamic in nature. The interest in the Evolutionary Algorithms (EAs) community in applying EA variants to dynamic optimization problems h...