Sciweavers

4488 search results - page 139 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
118
Voted
ICCBR
1995
Springer
15 years 7 months ago
On the use of CBR in optimisation problems such as the TSP
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
Padraig Cunningham, Barry Smyth, Neil J. Hurley
145
Voted
CIKM
1998
Springer
15 years 7 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 10 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
SIGMOD
2006
ACM
162views Database» more  SIGMOD 2006»
16 years 3 months ago
Efficient query processing in geographic web search engines
Geographic web search engines allow users to constrain and order search results in an intuitive manner by focusing a query on a particular geographic region. Geographic search tec...
Yen-Yu Chen, Torsten Suel, Alexander Markowetz
143
Voted
ICAI
2003
15 years 4 months ago
Exploiting the Marginal Profits of Constraints with Evolutionary Multi-Objective Optimization Techniques
Many real-world search and optimization problems naturally involve constraint handling. Recently, quite a few heuristic methods were proposed to solve the nonlinear constrained op...
Zhenyu Yan, Wei Zhi, Lishan Kang