Sciweavers

13376 search results - page 70 / 2676
» Problem Solving with
Sort
View
105
Voted
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 6 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
113
Voted
EVOW
2005
Springer
15 years 6 months ago
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
Juan José Pantrigo, Abraham Duarte, Á...
109
Voted
IFIP
2004
Springer
15 years 6 months ago
Solving Geometrical Place Problems by using Evolutionary Algorithms
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
Crina Grosan
TAPIA
2005
ACM
15 years 6 months ago
On a global optimization technique for solving a nonlinear hyperboloid least squares problem
We present a numerical experimentation of the global optimization algorithm presented by Velázquez et. al. [3] applied to a nonlinear hyperboloid least squares problem. This prob...
Leticia Velázquez, Miguel Argáez, Br...
126
Voted
CC
1994
Springer
107views System Software» more  CC 1994»
15 years 4 months ago
Solving Demand Versions of Interprocedural Analysis Problems
This paper concerns the solution of demand versions of interprocedural analysis problems. In a demand version of a program-analysis problem, some piece of summary information (e.g...
Thomas W. Reps