Sciweavers

756 search results - page 77 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
LISP
2006
105views more  LISP 2006»
13 years 8 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
ICTAC
2009
Springer
14 years 2 months ago
Input-Output Model Programs
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
Margus Veanes, Nikolaj Bjørner
ML
2008
ACM
100views Machine Learning» more  ML 2008»
13 years 8 months ago
Generalized ordering-search for learning directed probabilistic logical models
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...
LAMAS
2005
Springer
14 years 1 months ago
Multi-agent Relational Reinforcement Learning
In this paper we report on using a relational state space in multi-agent reinforcement learning. There is growing evidence in the Reinforcement Learning research community that a r...
Tom Croonenborghs, Karl Tuyls, Jan Ramon, Maurice ...
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 6 months ago
Towards a Collision-Free WLAN: Dynamic Parameter Adjustment in CSMA/E2CA
Abstract—Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is a distributed MAC protocol that allows collision-free access to the medium in WLAN. The onl...
Jaume Barceló, Boris Bellalta, Cristina Can...