We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
The focus of this paper is on VLIW instruction scheduling that minimizes the variation of power consumed by the processor during the execution of a target program. We use rough set...
With stock surpluses and shortages representing one of the greatest elements of risk to wholesalers, a solution to the multiretailer supply chain management problem would result i...
Caio Soares, Gerry V. Dozier, Emmett Lodree, Jared...
This paper shows how Markovian segmentation algorithms used to solve well known computer vision problems such as motion estimation, motion detection and stereovision can be signiï¬...
Pierre-Marc Jodoin, Max Mignotte, Jean-Franç...