Sciweavers

7106 search results - page 1209 / 1422
» Restricted Complexity, General Complexity
Sort
View
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 7 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
CPAIOR
2008
Springer
15 years 6 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
DAC
2008
ACM
15 years 6 months ago
IntellBatt: towards smarter battery design
Battery lifetime and safety are primary concerns in the design of battery operated systems. Lifetime management is typically supervised by the system via battery-aware task schedu...
Suman Kalyan Mandal, Praveen Bhojwani, Saraju P. M...
CSC
2008
15 years 6 months ago
The Dirichlet problem for the Laplace equation in a starlike domain
Many applications of Mathematical Physics and Engineering are connected with the Laplacian, however, the most part of BVP relevant to the Laplacian are solved in explicit form onl...
Diego Caratelli, Paolo Emilio Ricci
152
Voted
ECIR
2007
Springer
15 years 6 months ago
Enhancing Expert Search Through Query Modeling
An expert finding is a very common task among enterprise search activities, while its usual retrieval performance is far from the quality of the Web search. Query modeling helps t...
Pavel Serdyukov, Sergey Chernov, Wolfgang Nejdl
« Prev « First page 1209 / 1422 Last » Next »