100
click to vote
KDD
1994
ACM
15 years 26 days ago
1994
ACM
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
104
click to vote
ISAAC
1993
Springer
15 years 26 days ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
CPM
1994
Springer
15 years 27 days ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
ECAI
1998
Springer
15 years 1 months ago
1998
Springer
Abstract: Lazy computation is not new in model-based diagnosis of active systems (and of discreteevent systems in general). Up to a decade ago, diagnosis methods for discrete-event...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
WMCSA
2002
IEEE
15 years 1 months ago
2002
IEEE
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
105
click to vote
ISPAN
2002
IEEE
15 years 1 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
ISCAS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...