Sciweavers

64 search results - page 9 / 13
» Investigating Java Concurrency Using Abstract State Machines
Sort
View
ECML
2004
Springer
14 years 26 days ago
Batch Reinforcement Learning with State Importance
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
Lihong Li, Vadim Bulitko, Russell Greiner
ICRA
2007
IEEE
137views Robotics» more  ICRA 2007»
14 years 1 months ago
Integrated Debugging of Large Modular Robot Ensembles
Abstract— Creatively misquoting Thomas Hobbes, the process of software debugging is nasty, brutish, and all too long. This holds all the more true in robotics, which frequently i...
Benjamin D. Rister, Jason Campbell, Padmanabhan Pi...
POPL
2010
ACM
14 years 4 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
CONCURRENCY
2007
125views more  CONCURRENCY 2007»
13 years 7 months ago
VLab: collaborative Grid services and portals to support computational material science
: We present the initial architecture and implementation of VLab, a Grid and Web Service-based system for enabling distributed and collaborative computational chemistry and materia...
Mehmet A. Nacar, Mehmet S. Aktas, Marlon E. Pierce...
IANDC
2010
116views more  IANDC 2010»
13 years 6 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...