Sciweavers

4224 search results - page 166 / 845
» Reasoning about Choice
Sort
View
ICTAI
2003
IEEE
16 years 8 days ago
Q-Concept-Learning: Generalization with Concept Lattice Representation in Reinforcement Learning
One of the very interesting properties of Reinforcement Learning algorithms is that they allow learning without prior knowledge of the environment. However, when the agents use al...
Marc Ricordeau
USENIX
2008
15 years 9 months ago
Design Tradeoffs for SSD Performance
Solid-state disks (SSDs) have the potential to revolutionize the storage system landscape. However, there is little published work about their internal organization or the design ...
Nitin Agrawal, Vijayan Prabhakaran, Ted Wobber, Jo...
ALP
1997
Springer
15 years 11 months ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy
CL
2000
Springer
15 years 6 months ago
A New Equational Foundation for the Fluent Calculus
Abstract. A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the e...
Hans-Peter Störr, Michael Thielscher
FM
2005
Springer
98views Formal Methods» more  FM 2005»
16 years 16 days ago
Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern
The Mondex Electronic Purse system [18] is an outstanding example of formal refinement techniques applied to a genuine industrial scale application, and notably, was the first ve...
Richard Banach, Michael Poppleton, Czeslaw Jeske, ...