Sciweavers

438 search results - page 30 / 88
» New Search Heuristics for Max-CSP
Sort
View
EUSFLAT
2007
150views Fuzzy Logic» more  EUSFLAT 2007»
14 years 11 months ago
Competitive Self-adaptation in Evolutionary Algorithms
Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (...
Josef Tvrdík, Ivan Krivý
IJMC
2006
84views more  IJMC 2006»
14 years 9 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
68
Voted
AAAI
1997
14 years 11 months ago
Evidence for Invariants in Local Search
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem ...
David A. McAllester, Bart Selman, Henry A. Kautz
IWANN
2009
Springer
15 years 4 months ago
Efficient Exact Pattern-Matching in Proteomic Sequences
Abstract. This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficie...
Sérgio A. D. Deusdado, Paulo M. M. Carvalho
AUSAI
2004
Springer
15 years 3 months ago
Ant Colonies Discover Knight's Tours
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
Philip Hingston, Graham Kendall