Sciweavers

39 search results - page 5 / 8
» On Rational Trees
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Co-Logic Programming: Extending Logic Programming with Coinduction
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 5 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 8 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
SCHEDULING
2008
72views more  SCHEDULING 2008»
13 years 7 months ago
The impact of local policies on the quality of packet routing in paths, trees, and rings
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
Eric Angel, Evripidis Bampis, Fanny Pascual
CALCO
2009
Springer
162views Mathematics» more  CALCO 2009»
14 years 2 months ago
Semantics of Higher-Order Recursion Schemes
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
Jirí Adámek, Stefan Milius, Jiri Vel...