We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
This paper deals with polynomial stochastic hybrid systems (pSHSs), which generally correspond to stochastic hybrid systems with polynomial continuous vector fields, reset maps, a...
Predictive state representations (PSRs) are a recently proposed way of modeling controlled dynamical systems. PSR-based models use predictions of observable outcomes of tests that...