246 search results - page 10 / 50 » Dynamic Local Search for the Maximum Clique Problem |
92
Voted
JSAT
2008
14 years 9 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...
AAAI
2004
14 years 11 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
AUTOMATICA
2005
14 years 9 months ago
2005
This paper examines the problem of estimating linear time-invariant state-space system models. In particular it addresses the parametrization and numerical robustness concerns tha...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....