Sciweavers

1391 search results - page 212 / 279
» Complexity Limitations on Quantum Computation
Sort
View
ICALP
2010
Springer
13 years 10 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
APVIS
2001
13 years 9 months ago
Rapid Assembly and Deployment of Domain Visualisation Solutions
Information visualisation exploits the natural perceptual capabilities of the decisionfacilitate the rapid assimilation and analysis of abstract, complex and often voluminous info...
Tim Pattison, Rudi Vernik, Daniel Goodburn, Matthe...
IFIP13
2004
13 years 9 months ago
The Team-Based Operation of Safety-Critical Programmable Systems
This paper analyzes a range of incidents involving team-based interaction with safety-critical programmable systems. The incidents were submitted to NASA's Aviation Safety Rep...
C. W. Johnson
WSC
2004
13 years 9 months ago
Approximating Component Selection
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
Michael Roy Fox, David C. Brogan, Paul F. Reynolds...
AAAI
1996
13 years 9 months ago
Scaling Up Explanation Generation: Large-Scale Knowledge Bases and Empirical Studies
To explain complex phenomena, an explanation system must be able to select information from a formal representation of domain knowledge, organize the selected information into mul...
James C. Lester, Bruce W. Porter