Sciweavers

1026 search results - page 32 / 206
» An Optimal Solution to Room Search Problem
Sort
View
IPPS
2006
IEEE
15 years 5 months ago
An optimal approach to the task allocation problem on hierarchical architectures
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
Alexander Metzner, Martin Fränzle, Christian ...
LSSC
2007
Springer
15 years 6 months ago
Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
Stefka Fidanova
IDA
2003
Springer
15 years 5 months ago
An Iterated Local Search Approach for Minimum Sum-of-Squares Clustering
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
Peter Merz
CEC
2007
IEEE
15 years 6 months ago
Comparing bio-inspired algorithms in constrained optimization problems
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
Efrén Mezura-Montes, Blanca Cecilia Lopez-R...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 26 days ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella