Sciweavers

67 search results - page 10 / 14
» Reasoning on temporal class diagrams: Undecidability results
Sort
View
ICML
1995
IEEE
15 years 10 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
RE
2010
Springer
14 years 4 months ago
A UML-based static verification framework for security
Secure software engineering is a new research area that has been proposed to address security issues during the development of software systems. This new area of research advocates...
Igor Siveroni, Andrea Zisman, George Spanoudakis
AIR
2006
124views more  AIR 2006»
14 years 9 months ago
Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states
Abstract Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence...
Rodolfo Sabás Gómez, Juan Carlos Aug...
INFSOF
2007
104views more  INFSOF 2007»
14 years 9 months ago
A state-based approach to integration testing based on UML models
: Correct functioning of object-oriented software depends upon the successful integration of classes. While individual classes may function correctly, several new faults can arise ...
Shaukat Ali, Lionel C. Briand, Muhammad Jaffar-Ur ...
KR
2010
Springer
15 years 2 months ago
Probabilistic Description Logics for Subjective Uncertainty
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
Carsten Lutz, Lutz Schröder