Sciweavers

1047 search results - page 48 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
VLDB
1997
ACM
132views Database» more  VLDB 1997»
13 years 12 months ago
Integrating SQL Databases with Content-Specific Search Engines
In recentyears,databaseresearchandproduct developmentactivities havefocusedonsupport for non-traditional data types, such astext or multi-media documents.This paper describes an a...
Stefan Deßloch, Nelson Mendonça Matto...
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
GIS
2008
ACM
14 years 8 months ago
The multi-rule partial sequenced route query
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number...
Haiquan Chen, Wei-Shinn Ku, Min-Te Sun, Roger Zimm...
CP
2010
Springer
13 years 5 months ago
Contingency Plans for Air Traffic Management
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
Karl Sundequist Blomdahl, Pierre Flener, Justin Pe...
BMCBI
2008
105views more  BMCBI 2008»
13 years 8 months ago
Objective and automated protocols for the evaluation of biomedical search engines using No Title Evaluation protocols
Background: The evaluation of information retrieval techniques has traditionally relied on human judges to determine which documents are relevant to a query and which are not. Thi...
Fabien Campagne