Sciweavers

2244 search results - page 53 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
CP
2007
Springer
16 years 8 days ago
Dynamic Management of Heuristics for Solving Structured CSPs
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
IJAIT
2002
81views more  IJAIT 2002»
15 years 5 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
FUIN
2010
109views more  FUIN 2010»
15 years 4 months ago
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
António Morgado, João Marques-Silva
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
15 years 11 months ago
An artificial immune network for multimodal function optimization on dynamic environments
Multimodal optimization algorithms inspired by the immune system are generally characterized by a dynamic control of the population size and by diversity maintenance along the sea...
Fabrício Olivetti de França, Fernand...
EOR
2007
95views more  EOR 2007»
15 years 6 months ago
A hybrid genetic algorithm for the two-dimensional single large object placement problem
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
Eleni Hadjiconstantinou, Manuel Iori