Sciweavers

1568 search results - page 5 / 314
» The problem of examination questions in algorithmics
Sort
View
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 7 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik
IPL
2007
69views more  IPL 2007»
15 years 5 months ago
On the fixed-parameter tractability of the equivalence test of monotone normal forms
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
Matthias Hagen
140
Voted
ICADL
2004
Springer
110views Education» more  ICADL 2004»
15 years 10 months ago
Hot-Spot Passage Retrieval in Question Answering
Question Answering has been the recent focus of information retrieval research; many systems just incorporate a search engine as a black box and most effort has been devoted to the...
Jian Huang, Xuanjing Huang, Lide Wu
121
Voted
STOC
2006
ACM
117views Algorithms» more  STOC 2006»
15 years 11 months ago
Pseudorandom walks on regular digraphs and the RL vs. L problem
We revisit the general RL vs. L question, obtaining the following results.
Omer Reingold, Luca Trevisan, Salil P. Vadhan
NAACL
2003
15 years 6 months ago
Evaluating the Evaluation: A Case Study Using the TREC 2002 Question Answering Track
Evaluating competing technologies on a common problem set is a powerful way to improve the state of the art and hasten technology transfer. Yet poorly designed evaluations can was...
Ellen M. Voorhees