Sciweavers

470 search results - page 9 / 94
» Tabu Search for SAT
Sort
View
JSAT
2008
80views more  JSAT 2008»
13 years 7 months ago
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based o...
Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Art...
EVOW
2009
Springer
14 years 2 months ago
Binary Exponential Back Off for Tabu Tenure in Hyperheuristics
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
Stephen Remde, Keshav P. Dahal, Peter I. Cowling, ...
4OR
2010
82views more  4OR 2010»
13 years 7 months ago
Diversification-driven tabu search for unconstrained binary quadratic problems
This paper describes a Diversification-Driven Tabu Search (D2 TS) algorithm for solving unconstrained binary quadratic problems. D2 TS is dis
Fred Glover, Zhipeng Lü, Jin-Kao Hao
AIPS
2006
13 years 9 months ago
Lemma Reusing for SAT based Planning and Scheduling
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, K...