Sciweavers

GIS
2010
ACM
13 years 2 months ago
Detecting nearly duplicated records in location datasets
The quality of a local search engine, such as Google and Bing Maps, heavily relies on its geographic datasets. Typically, these datasets are obtained from multiple sources, e.g., ...
Yu Zheng, Xixuan Fen, Xing Xie, Shuang Peng, James...
TIP
2002
109views more  TIP 2002»
13 years 3 months ago
Adaptive rood pattern search for fast block-matching motion estimation
In this paper, we propose a novel and simple fast block-matching algorithm (BMA), called adaptive rood pattern search (ARPS), which consists of two sequential search stages: 1) ini...
Yao Nie, Kai-Kuang Ma
JAR
2000
149views more  JAR 2000»
13 years 3 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang
JAIR
2000
123views more  JAIR 2000»
13 years 3 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
AMC
2004
115views more  AMC 2004»
13 years 3 months ago
Performance comparison of memetic algorithms
Local search techniques have been applied in optimization methods. The effect of local search to the memetic algorithms can make multimodal and non-linear problems easier to solve...
Jason G. Digalakis, Konstantinos G. Margaritis
JSW
2006
76views more  JSW 2006»
13 years 3 months ago
Variable Neighbourhood Search for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
Mehmet Sevkli, Mehmet Emin Aydin
JSAT
2008
122views more  JSAT 2008»
13 years 3 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
JSAT
2008
99views more  JSAT 2008»
13 years 3 months ago
A Switching Criterion for Intensification and Diversification in Local Search for SAT
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
Wanxia Wei, Chu Min Li, Harry Zhang
JSAT
2008
113views more  JSAT 2008»
13 years 3 months ago
Combining Adaptive and Dynamic Local Search for Satisfiability
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...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
COR
2007
143views more  COR 2007»
13 years 3 months ago
A memetic algorithm for channel assignment in wireless FDMA systems
A new problem encoding is devised for the minimum span frequency assignment problem in wireless communications networks which is compact and general. Using the new encoding, which...
Sung-Soo Kim, Alice E. Smith, Jong-Hyun Lee