628 search results - page 40 / 126 » On the Twofish Key Schedule |
SOFSEM
2009
Springer
14 years 5 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for ...
CEC
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
EOR
2010
13 years 8 months ago
2010
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
EOR
2008
13 years 8 months ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...