Sciweavers

14548 search results - page 316 / 2910
» The Optimal Path-Matching Problem
Sort
View
EMMCVPR
2009
Springer
16 years 2 months ago
General Search Algorithms for Energy Minimization Problems
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
Dmitrij Schlesinger
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
16 years 1 months ago
ACO vs EAs for solving a real-world frequency assignment problem in GSM networks
Frequency planning is a very important task for current GSM operators. In this work we present a new mathematical formulation of the problem in which the frequency plans are evalu...
Francisco Luna, Christian Blum, Enrique Alba, Anto...
PPAM
2007
Springer
16 years 1 months ago
Parallel Simulated Annealing Algorithm for Graph Coloring Problem
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swie...
180
Voted
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
16 years 1 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
ICDAR
2003
IEEE
16 years 23 days ago
Binary Classification Trees for Multi-class Classification Problems
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
Jin-Seon Lee, Il-Seok Oh