Sciweavers

7 search results - page 2 / 2
» Dynamic Minimization of Word-Level Decision Diagrams
Sort
View
AIPS
2003
14 years 10 months ago
Decision-Theoretic Group Elevator Scheduling
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...
Daniel Nikovski, Matthew Brand
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 2 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki