Sciweavers

9284 search results - page 1470 / 1857
» Knowledge State Algorithms
Sort
View
ICLP
2010
Springer
15 years 10 months ago
A Logical Paradigm for Systems Biology (Invited Talk)
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...
François Fages
KDD
2010
ACM
282views Data Mining» more  KDD 2010»
15 years 10 months ago
Optimizing debt collections using constrained reinforcement learning
In this paper, we propose and develop a novel approach to the problem of optimally managing the tax, and more generally debt, collections processes at financial institutions. Our...
Naoki Abe, Prem Melville, Cezar Pendus, Chandan K....
WCNC
2010
IEEE
15 years 10 months ago
Cross Layer Implementation of a Multi-User MIMO Test-Bed
Abstract—This paper describes an implementation of a realtime multi-user multiple-input multiple-output (MU-MIMO) communication system, with cross-layer channel-aware scheduling....
Niklas Jalden, Svante Bergman, Per Zetterberg, Bj&...
FM
2009
Springer
169views Formal Methods» more  FM 2009»
15 years 10 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
ACSD
2004
IEEE
113views Hardware» more  ACSD 2004»
15 years 10 months ago
Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
« Prev « First page 1470 / 1857 Last » Next »