Sciweavers

944 search results - page 66 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
SIGIR
2012
ACM
13 years 2 months ago
Automatic suggestion of query-rewrite rules for enterprise search
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
Zhuowei Bao, Benny Kimelfeld, Yunyao Li
EUROMICRO
2000
IEEE
15 years 4 months ago
Task Assignment and Scheduling under Memory Constraints
Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constrain...
Radoslaw Szymanek, Krzysztof Kuchcinski
ICDE
2004
IEEE
151views Database» more  ICDE 2004»
16 years 1 months ago
Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks
We study the problem of maintaining large replicated collections of files or documents in a distributed environment with limited bandwidth. This problem arises in a number of impo...
Torsten Suel, Patrick Noel, Dimitre Trendafilov
NLP
2000
15 years 3 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
RECOMB
2002
Springer
16 years 4 days ago
Provably sensitive Indexing strategies for biosequence similarity search
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
Jeremy Buhler