Sciweavers

6036 search results - page 59 / 1208
» Web search solved
Sort
View
WSC
2004
13 years 11 months ago
A Meta-Heuristic Based on Simulated Annealing for Solving Multiple-Objective Problems in Simulation Optimization
This paper presents a new meta heuristic algorithm based on the search method called simulated annealing, and its application to solving multi objective simulation optimization pr...
Eduardo Alberto Avello, Felipe F. Baesler, Reinald...
CP
2003
Springer
14 years 3 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
INFOVIS
2000
IEEE
14 years 2 months ago
Interactive Problem Solving via Algorithm Visualization
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
Pearl Pu, Denis Lalanne
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
CEC
2011
IEEE
12 years 10 months ago
Differential evolution with multiple strategies for solving CEC2011 real-world numerical optimization problems
—Over the last two decades, many Differential Evolution (DE) strategies have been introduced for solving Optimization Problems. Due to the variability of the characteristics in o...
Saber M. Elsayed, Ruhul A. Sarker, Daryl Essam