Sciweavers

343 search results - page 40 / 69
» Normal State Implicature
Sort
View
RTA
2010
Springer
15 years 3 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
15 years 1 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
LISA
2000
15 years 1 months ago
Peep (The Network Auralizer): Monitoring Your Network with Sound
Activities in complex networks are often both too important to ignore and too tedious to watch. We created a network monitoring system, Peep, that replaces visual monitoring with ...
Michael Gilfix, Alva L. Couch
TSMC
2008
146views more  TSMC 2008»
14 years 11 months ago
Decentralized Learning in Markov Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
Peter Vrancx, Katja Verbeeck, Ann Nowé
TIT
2002
91views more  TIT 2002»
14 years 11 months ago
Hidden Markov processes
An overview of statistical and information-theoretic aspects of hidden Markov processes (HMPs) is presented. An HMP is a discrete-time finite-state homogeneous Markov chain observe...
Yariv Ephraim, Neri Merhav