We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
Christian Eggermont, Alexander Schrijver, Gerhard ...
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
This paper describes an approach for designing a power management plan that matches the supply of power with the demand for power in data centers. Power may come from the grid, fro...
Daniel Gmach, Jerry Rolia, Cullen Bash, Yuan Chen,...
— The accurate detection of object boundaries via active contours is an ongoing research topic in computer vision. Most active contours converge towards some desired contour by m...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...