Sciweavers

1684 search results - page 173 / 337
» The lexicographic decision function
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 6 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
ATAL
2004
Springer
15 years 6 months ago
Communication for Improving Policy Computation in Distributed POMDPs
Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to joi...
Ranjit Nair, Milind Tambe, Maayan Roth, Makoto Yok...
DIAGRAMS
2004
Springer
15 years 6 months ago
A Cognitive Processing Perspective on Student Programmers' 'Graphicacy'
The ‘graphicacy’ of student programmers was investigated using several cognitive tasks designed to assess ER knowledge representation at the perceptual, semantic and output lev...
Richard Cox, Pablo Romero, Benedict du Boulay, Rud...
TYPES
2004
Springer
15 years 6 months ago
Exploring the Regular Tree Types
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
Peter Morris, Thorsten Altenkirch, Conor McBride
COMPSAC
2003
IEEE
15 years 6 months ago
A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-Yen...