Markovian binary trees form a class of continuous-time branching processes where the lifetime and reproduction epochs of individuals are controlled by an underlying Markov process. An Expectation–Maximization (EM) algorithm is developed to estimate the parameters of the Markov process from the...

In this paper, we describe a link between Markovian binary trees (MBT) and tree-like quasi-birth-and-death processes (TLQBD) by associating a specific TLQBD to each MBT. The algorithms to compute the matrices Gk in the TLQBD then correspond to the algorithms calculating the extinction...

This paper shows that in the G/M/1 queueing model, conditioning on a busy server, the age of the inter-arrival time and the number of customers in the queue are independent. The same is the case when the age is replaced by the residual inter-arrival time or by its total value. Explicit...

We study the customers' Nash equilibrium behavior in a single server observable queue with Poisson arrivals and general service times. Each customer takes a single decision upon arrival: to join or not to join. Furthermore, future regrets are not allowed. The customers are homogenous with...

This paper shows that in the G/M/1 queueing model, conditioning on a busy server, the age of the inter-arrival time and the number of customers in the queue are independent. The same is the case when the age is replaced by the residual inter-arrival time or by its total value. Explicit...

"Enabling project managers to adapt to the new technology of artificial intelligence, this first comprehensive book on the topic discusses how AI will reinvent the project world and allow project managers to focus on people. Studies show that by 2030, 80% of project management tasks, such as...