1007 search results - page 18 / 202 » The Complexity of Futile Questioning |
WSC
2000
13 years 11 months ago
2000
Nowadays the size and complexity of models is growing more and more, forcing modelers to face some problems that they were not accustomed to. Before trying to study ways to deal w...
RTSS
1998
IEEE
14 years 1 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
CIKM
2008
Springer
13 years 11 months ago
2008
Springer
The need for high performance and throughput Question Answering (QA) systems demands for their migration to distributed environments. However, even in such cases it is necessary t...
AWIC
2003
Springer
14 years 2 months ago
2003
Springer
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
APAL
2006
13 years 9 months ago
2006
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...