Sciweavers

419 search results - page 33 / 84
» Succincter
Sort
View
ISIPTA
2005
IEEE
119views Mathematics» more  ISIPTA 2005»
15 years 3 months ago
Ordinal Subjective Foundations for Finite-domain Probability Agreement
Normative study of probability-agreeing orderings of propositions, much of it rooted in a false but evocative conjecture of Bruno de Finetti, has typically sought to credal ration...
Paul Snow
LICS
2005
IEEE
15 years 3 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
ATVA
2005
Springer
112views Hardware» more  ATVA 2005»
15 years 3 months ago
Reasoning About Transfinite Sequences
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequen...
Stéphane Demri, David Nowak
ICCS
2005
Springer
15 years 3 months ago
PATM: Priority-Based Adaptive Topology Management for Efficient Routing in Ad Hoc Networks
Abstract. We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected ...
Haixia Tan, Weilin Zeng, Lichun Bao
SAT
2005
Springer
123views Hardware» more  SAT 2005»
15 years 3 months ago
Bounded Model Checking with QBF
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
Nachum Dershowitz, Ziyad Hanna, Jacob Katz