Sciweavers

828 search results - page 116 / 166
» Simplicial Powers of Graphs
Sort
View
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
13 years 9 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
FMSD
2008
94views more  FMSD 2008»
13 years 7 months ago
Optimal infinite scheduling for multi-priced timed automata
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larse...
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen
AI
2005
Springer
13 years 7 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
INFSOF
2007
81views more  INFSOF 2007»
13 years 7 months ago
An infrastructure to support interoperability in reverse engineering
An infrastructure is a set of interconnected structural elements, such as tools and schemas, that provide a framework for supporting an entire structure. The reverse engineering c...
Nicholas A. Kraft, Brian A. Malloy, James F. Power