Selecting an effective project plan is a significant area in the project management. The present paper introduces a technique to identify the project plan efficient frontier for assessing the alternative project plans and selecting the best plan. The efficient frontier includes two criteria: the project cost and the project time. Besides, the paper presents a scheme to incorporate Directed Ac...

Tree-width is a well-known metric on undirected graphs that measures how tree-like a graph is and gives a notion of graph decomposition that proves useful in algorithm design. Treewidth can be characterised by a graph searching game where a number of cops attempt to capture a robber. We consider the natural adaptation of this game to directed graphs and show that monotone strategies in the game...

Synchronous Data Flow (SDF) is a useful computational model in image processing, computer vision, and DSP. Previously, throughput and buffer requirement analyses have been studied for SDFs. In this paper, we address energy-aware scheduling for acyclic SDFs on multiprocessors. The multiprocessor considered here has the capability of Dynamic Voltage and Frequency Scaling (DVFS), which allows proc...

Tree-width is a well-known metric on undirected graphs that measures how tree-like a graph is and gives a notion of graph decomposition that proves useful in algorithm development. Tree-width is characterised by a game known as the cops-and-robber game where a number of cops chase a robber on the graph. We consider the natural adaptation of this game to directed graphs and show that monotone st...

Directed acyclic graph (DAG) models may be characterized in four different ways: via a factorization, the dseparation criterion, the moralization criterion, and the local Markov property. As pointed out by Robins [2, 1], Verma and Pearl [6], and Tian and Pearl [5], marginals of DAG models also imply equality constraints that are not conditional independences. The well-known ‘Verma constraint’ i...

a r t i c l e i n f o This paper deals with the estimation of state changes in system descriptions for dynamic Bayesian networks (DBNs) by using a genetic procedure and particle filters (PFs). We extend the DBN scheme to more general cases with unknown Directed Acyclic Graph (DAG) and state changes. First, we summarize the basic model of DBN where the DAG can be changed and the state transition...

Using a directed acyclic graph (dag) model of algorithms, several computational complexity measures are defined in terms of time, period, and processors. Research interest is explained for designs that are timeminimal, processor-time-minimal, and period-processortime-minimal. Such designs are illustrated with the standard matrix product algorithm, modeled by the n×n×n directed mesh.

Causal learning methods are often evaluated in terms of their ability to discover a true underlying directed acyclic graph (DAG) structure. However, in general the true structure is unknown and may not be a DAG structure. We therefore consider evaluating causal learning methods in terms of predicting the effects of interventions on unseen test data. Given this task, we show that there exist a v...