1816 search results - page 352 / 364 » ITS Domain Modelling with Ontology |
ISSTA
2000
ACM
15 years 2 months ago
2000
ACM
A number of different concepts have been proposed that, loosely speaking, revolve around the notion of software testability. Indeed, the concept of testability itself has been int...
CC
2006
Springer
15 years 1 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
101
click to vote
RSS
2007
14 years 11 months ago
2007
Abstract— This paper proposes a simulation-based active policy learning algorithm for finite-horizon, partially-observed sequential decision processes. The algorithm is tested i...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...