Sciweavers

1581 search results - page 159 / 317
» Domain semantics of possibility computations
Sort
View
AIPS
2010
15 years 6 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
LICS
2009
IEEE
15 years 10 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
ENTCS
2010
88views more  ENTCS 2010»
15 years 3 months ago
On the Observable Behaviour of Composite Components
The crucial strength of the component paradigm lies in the possibility to encapsulate behaviours. In this work, we focus on the observable behaviour of composite components which ...
Rolf Hennicker, Stephan Janisch, Alexander Knapp
201
Voted
GIS
2006
ACM
16 years 4 months ago
Mining frequent geographic patterns with knowledge constraints
The large amount of patterns generated by frequent pattern mining algorithms has been extensively addressed in the last few years. In geographic pattern mining, besides the large ...
Luis Otávio Alvares, Paulo Martins Engel, S...
ICFP
2006
ACM
16 years 3 months ago
Modular development of certified program verifiers with a proof assistant
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
Adam J. Chlipala