Sciweavers

1341 search results - page 87 / 269
» Automatic Algorithm Configuration Based on Local Search
Sort
View
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 1 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
CP
1995
Springer
15 years 1 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
FIMH
2009
Springer
14 years 7 months ago
Discriminative Joint Context for Automatic Landmark Set Detection from a Single Cardiac MR Long Axis Slice
Cardiac magnetic resonance (MR) imaging has advanced to become a powerful diagnostic tool in clinical practice. Automatic detection of anatomic landmarks from MR images is importan...
Xiaoguang Lu, Bogdan Georgescu, Arne Littmann, Edg...
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 6 months ago
A Hybrid RTS-BP Algorithm for Improved Detection of Large-MIMO M-QAM Signals
Abstract--Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive ta...
Tanumay Datta, N. Srinidhi, Ananthanarayanan Chock...
IWPEC
2009
Springer
15 years 4 months ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
Peter Damaschke