Sciweavers

472 search results - page 70 / 95
» Design of Iterated Local Search Algorithms
Sort
View
TSP
2008
126views more  TSP 2008»
14 years 9 months ago
HOS-Based Semi-Blind Spatial Equalization for MIMO Rayleigh Fading Channels
In this paper we concentrate on the direct semi-blind spatial equalizer design for MIMO systems with Rayleigh fading channels. Our aim is to develop an algorithm which can outperf...
Zhiguo Ding, Tharmalingam Ratnarajah, Colin Cowan
FOGA
2011
14 years 1 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
AAAI
2007
14 years 12 months ago
Refutation by Randomised General Resolution
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
Steven David Prestwich, Inês Lynce
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 1 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
KR
2004
Springer
15 years 3 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner