Sciweavers

342 search results - page 16 / 69
» Combinatorial Framework for Similarity Search
Sort
View
GIS
2008
ACM
14 years 9 months ago
Mining user similarity based on location history
The pervasiveness of location-acquisition technologies (GPS, GSM networks, etc.) enable people to conveniently log the location histories they visited with spatio-temporal data. T...
Quannan Li, Yu Zheng, Xing Xie, Yukun Chen, Wenyu ...
CEC
2008
IEEE
14 years 3 months ago
Evolutionary Multi-objective Simulated Annealing with adaptive and competitive search direction
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
Hui Li, Dario Landa Silva
EVOW
2005
Springer
14 years 2 months ago
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
Juan José Pantrigo, Abraham Duarte, Á...
JSAT
2010
132views more  JSAT 2010»
13 years 3 months ago
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
Federico Heras, David Bañeres
MVA
1998
230views Computer Vision» more  MVA 1998»
13 years 10 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...