Sciweavers

1047 search results - page 55 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 6 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
CIKM
2006
Springer
13 years 9 months ago
Voting for candidates: adapting data fusion techniques for an expert search task
In an expert search task, the users' need is to identify people who have relevant expertise to a topic of interest. An expert search system predicts and ranks the expertise o...
Craig Macdonald, Iadh Ounis
BMCBI
2010
149views more  BMCBI 2010»
13 years 8 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
JSA
2000
175views more  JSA 2000»
13 years 7 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
SOFSEM
2007
Springer
14 years 1 months ago
Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces
Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, ca...
Oscar Pedreira, Nieves R. Brisaboa