Probabilistic models, such as hidden Markov models or Bayesian networks, are commonly used to model biological data. Much of their popularity can be attributed to the existence of efficient and robust ...

Abstract: An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely used to solve flow-shop scheduling problems (FSPs), an important branch of production scheduling ...

Abstract: The aim of this tutorial is to provide an overview, although necessarily incomplete, of game theory (GT) for signal processing (SP) in networks. One of the main features of this contribution ...