Sciweavers

971 search results - page 27 / 195
» Approximate Satisfiability and Equivalence
Sort
View
ICCS
2004
Springer
14 years 3 months ago
A Cartesian Closed Category of Approximable Concept Structures
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
Pascal Hitzler, Guo-Qiang Zhang
TWC
2008
150views more  TWC 2008»
13 years 9 months ago
Convex approximation techniques for joint multiuser downlink beamforming and admission control
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network o...
Evaggelia Matskani, Nicholas D. Sidiropoulos, Zhi-...
IJAR
2010
75views more  IJAR 2010»
13 years 8 months ago
Generalized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...
FM
2006
Springer
146views Formal Methods» more  FM 2006»
14 years 1 months ago
Exact and Approximate Strategies for Symmetry Reduction in Model Checking
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
Alastair F. Donaldson, Alice Miller
LICS
2006
IEEE
14 years 3 months ago
Temporal Logics and Model Checking for Fairly Correct Systems
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
Daniele Varacca, Hagen Völzer