583 search results - page 22 / 117 » Finding Answers to Complex Questions |
100
click to vote
CHI
2000
ACM
15 years 4 months ago
2000
ACM
When a novice needs help, often the best solution is to find a human expert who is capable of answering the novice’s questions. But often, novices have difficulty characterizing...
110
click to vote
TAMC
2007
Springer
15 years 5 months ago
2007
Springer
We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, find a duplicate in the sequence, ...
103
click to vote
CPM
2004
Springer
15 years 3 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
111
click to vote
CLEF
2010
Springer
15 years 24 days ago
2010
Springer
This paper summarizes the results of our first participation at ResPubliQA. Lacking a true question answering system, we relied on our traditional search engine to find the answers...
ORL
2007
14 years 11 months ago
2007
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...