Sciweavers

920 search results - page 46 / 184
» Generating Satisfiable Problem Instances
Sort
View
EMO
2003
Springer
137views Optimization» more  EMO 2003»
14 years 3 months ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle
CSFW
2007
IEEE
14 years 4 months ago
The Insecurity Problem: Tackling Unbounded Data
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
Sibylle B. Fröschle
ESCIENCE
2006
IEEE
14 years 2 months ago
Grid Enabled Problem Solving Environments for Text Categorization
As the large volume of resources involved and the power of computational Grids increased, there is a corresponding and urgent need for employ the grid technologies into problem so...
Jian Mei, Wu Zhang, Suge Wang
COR
2008
118views more  COR 2008»
13 years 10 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
EOR
2006
91views more  EOR 2006»
13 years 10 months ago
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
A. Miguel Gomes, José F. Oliveira