657 search results - page 70 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
FOCS
1994
IEEE
15 years 4 months ago
1994
IEEE
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
107
click to vote
CATS
2006
15 years 1 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
104
click to vote
FUN
2010
Springer
15 years 4 months ago
2010
Springer
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
CSFW
2008
IEEE
15 years 6 months ago
2008
IEEE
Zdancewic and Myers introduced observational determinism as a scheduler independent notion of security for concurrent programs. This paper proposes a type system for verifying obs...