725 search results - page 2 / 145 » Smoothed Analysis of Algorithms and Heuristics |
IJAMCIGI
2010
14 years 6 months ago
2010
In recent years a lot of novel (mostly naturally inspired) search heuristics have been
SIGIR
2008
ACM
14 years 11 months ago
2008
ACM
Recent work on language models for information retrieval has shown that smoothing language models is crucial for achieving good retrieval performance. Many different effective smo...
97
Voted
CSCLP
2005
Springer
15 years 5 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
COR
2006
14 years 11 months ago
2006
