Sciweavers

9626 search results - page 303 / 1926
» Invariant Based Programming
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
CSFW
2009
IEEE
15 years 10 months ago
Specification and Analysis of Dynamic Authorisation Policies
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
Moritz Y. Becker
ICFP
2006
ACM
16 years 6 months ago
Static typing for a faulty lambda calculus
A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorr...
David Walker, Lester W. Mackey, Jay Ligatti, Georg...
SIGCSE
2000
ACM
146views Education» more  SIGCSE 2000»
15 years 11 months ago
Programming patterns and design patterns in the introductory computer science course
We look at the essential thinking skills students need to learn in the introductory computer science course based on object-oriented programming. We create a framework for such a ...
Viera K. Proulx
ECOOP
1999
Springer
15 years 11 months ago
Towards Automatic Specialization of Java Programs
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
Ulrik Pagh Schultz, Julia L. Lawall, Charles Conse...