63 search results - page 6 / 13 » Optimal Parametric Search on Graphs of Bounded Tree-Width |
AI
2011
Springer
13 years 3 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
CPAIOR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
CP
2007
Springer
14 years 2 months ago
2007
Springer
We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint opt...
EUROCAST
2007
Springer
14 years 16 days ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
PODC
2011
ACM
12 years 11 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...