Sciweavers

5158 search results - page 140 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
APAL
2002
83views more  APAL 2002»
13 years 10 months ago
Inherently nonfinitely based lattices
We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) genera...
Ralph Freese, George F. McNulty, James B. Nation
SAGT
2010
Springer
223views Game Theory» more  SAGT 2010»
13 years 8 months ago
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
Vittorio Bilò, Ioannis Caragiannis, Angelo ...
ICALP
2009
Springer
14 years 10 months ago
Approximating Markov Processes by Averaging
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
ALT
2009
Springer
14 years 7 months ago
Canonical Horn Representations and Query Learning
Abstract. We describe an alternative construction of an existing canonical representation for definite Horn theories, the Guigues-Duquenne basis (or GD basis), which minimizes a n...
Marta Arias, José L. Balcázar
ACTA
2004
86views more  ACTA 2004»
13 years 10 months ago
Specification transformers: a predicate transformer approach to composition
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
Michel Charpentier, K. Mani Chandy