1007 search results - page 50 / 202 » The Complexity of Futile Questioning |
100
Voted
CIE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
109
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...
107
click to vote
EMNLP
2006
15 years 5 months ago
2006
Complex tasks like question answering need to be able to identify events in text and the relations among those events. We show that this event identification task and a related ta...
120
click to vote
DAGSTUHL
2003
15 years 5 months ago
2003
— The paper focuses on the problem how a community of distributed agents may autonomously invent and coordinate lexicons and grammars. Although our earlier experiments have shown...
139
click to vote
SIGMETRICS
1998
ACM
15 years 3 months ago
1998
ACM
The increasing complexity of computer networks and our increasing dependence on them means enforcing reliability requirements is both more challenging and more critical. The expan...