69 search results - page 9 / 14 » First Order Decision Diagrams for Relational MDPs |
CAISE
2005
Springer
14 years 1 months ago
2005
Springer
Meeting is one of the most common places where decisions are made. However, since there is hardly any formal documentation concerning decisions made in meetings, it turns out to be...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
ISAAC
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
ISSTA
1998
ACM
13 years 11 months ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...