Sciweavers

4432 search results - page 39 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
IPPS
1999
IEEE
14 years 2 months ago
Parallel Ant Colonies for Combinatorial Optimization Problems
Abstract. Ant Colonies AC optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies...
El-Ghazali Talbi, Olivier Roux, Cyril Fonlupt, Den...
DEXA
2005
Springer
109views Database» more  DEXA 2005»
14 years 3 months ago
Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem
The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specifica...
Marko Smiljanic, Maurice van Keulen, Willem Jonker
CONSTRAINTS
2011
13 years 4 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
PRICAI
2004
Springer
14 years 3 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
14 years 3 months ago
Solving large scale combinatorial optimization using PMA-SLS
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong, Meng Joo E...