147 search results - page 11 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
156
click to vote
ATMOS
2008
15 years 7 months ago
2008
Abstract. In this paper we explore the possibility of applying the notions of Recoverable Robustness and Price of Recoverability (introduced by [5]) to railway rolling stock planni...
165
click to vote
FSE
2006
Springer
15 years 9 months ago
2006
Springer
We study a recently proposed design approach of Feistel structure which employs diffusion matrices in a switching way. At ASIACRYPT 2004, Shirai and Preneel have proved that large ...
142
click to vote
AAAI
2006
15 years 7 months ago
2006
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
185
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
All-to-all broadcast scheduling problems are considered in WDM optical passive star networks where k wavelengths are available in the network. It is assumed that each node has exac...
179
click to vote
COR
2011
15 years 16 days ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...