Sciweavers

1019 search results - page 39 / 204
» Uniform Functors on Sets
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs
An important issue towards a broader acceptance of answer-set programming (ASP) is the deployment of tools which support the programmer during the coding phase. In particular, met...
Johannes Oetsch, Jörg Pührer, Hans Tompi...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 6 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
AC
2003
Springer
14 years 26 days ago
Unbounded Petri Net Synthesis
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
Philippe Darondeau
SSDBM
2007
IEEE
212views Database» more  SSDBM 2007»
14 years 1 months ago
Adaptive-Size Reservoir Sampling over Data Streams
Reservoir sampling is a well-known technique for sequential random sampling over data streams. Conventional reservoir sampling assumes a fixed-size reservoir. There are situation...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...
CSL
2010
Springer
13 years 8 months ago
Fibrational Induction Rules for Initial Algebras
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
Neil Ghani, Patricia Johann, Clément Fumex