Sciweavers

2214 search results - page 208 / 443
» Complexity of Reasoning
Sort
View
RSP
1999
IEEE
15 years 8 months ago
System Design Validation Using Formal Models
Formal methods are a nice idea, but the size and complexity of real systems means that they are impractical. We propose that a reasonable alternative to attempting to specify and ...
Peter Henderson, Robert John Walters
UAI
2004
15 years 5 months ago
Dynamic Programming for Structured Continuous Markov Decision Problems
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
Zhengzhu Feng, Richard Dearden, Nicolas Meuleau, R...
UML
2004
Springer
15 years 9 months ago
Specifying Cross-Cutting Requirement Concerns
Addressing non-orthogonal software concerns that arisefrom requirements can significantly contribute to the complexity of developing large systems. Difficulties arise from the need...
Geri Georg, Raghu Reddy, Robert B. France
CCIA
2010
Springer
14 years 10 months ago
WizArg: Visual Argumentation Framework Solving Wizard
Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. An important concern in extensionbased-argumentation semantics is t...
Ignasi Gómez-Sebastià, Juan Carlos N...
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
15 years 10 months ago
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
Craig Gentry