Sciweavers

510 search results - page 25 / 102
» How Should We Solve Search Problems Privately
Sort
View
JSC
2010
103views more  JSC 2010»
13 years 6 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...
ECIR
2007
Springer
13 years 9 months ago
A Parameterised Search System
This paper introduces the concept of a Parameterised Search System (PSS), which allows flexibility in user queries, and, more importantly, allows system engineers to easily defin...
Roberto Cornacchia, Arjen P. de Vries
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 8 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu
ATAL
2003
Springer
14 years 22 days ago
Agent network topology and complexity
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
Xiaolong Jin, Jiming Liu
CEC
2005
IEEE
14 years 1 months ago
Adaptive local search parameters for real-coded memetic algorithms
AbstractThis paper presents a real-coded memetic algorithm that combines a high diversity global exploration with an adaptive local search method to the most promising individuals ...
Daniel Molina, Francisco Herrera, Manuel Lozano