Sciweavers

478 search results - page 32 / 96
» Monads of Regular Theories
Sort
View
FOSSACS
2009
Springer
15 years 5 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
BIRTHDAY
2006
Springer
15 years 2 months ago
Uniform Functors on Sets
This paper is a contribution to the study of uniformity conditions for endofunctors on sets initiated in Aczel [1] and pursued later in other works such as Turi [17]. The main res...
Lawrence S. Moss
AAAI
2008
15 years 1 months ago
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
Georg Gottlob, Reinhard Pichler, Fang Wei
JUCS
2010
107views more  JUCS 2010»
14 years 9 months ago
Algebras and Update Strategies
: The classical (Bancilhon-Spyratos) correspondence between view update translations and views with a constant complement reappears more generally as the correspondence between upd...
Michael Johnson, Robert D. Rosebrugh, Richard Wood
IPSN
2003
Springer
15 years 4 months ago
Boundary Estimation in Sensor Networks: Theory and Methods
Sensor networks have emerged as a fundamentally new tool for monitoring spatially distributed phenomena. This paper investigates a strategy by which sensor nodes detect and estima...
Robert Nowak, Urbashi Mitra