We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
If a program does not fulfill a given specification, a model checker delivers a counterexample, a run which demonstrates the wrong behavior. Even with a counterexample, locating...
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference i...