7065 search results - page 424 / 1413 » Iterative Scheduling Algorithms |
301
click to vote
AUSSOIS
2001
Springer
15 years 11 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
171
click to vote
AC
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. This paper examines proposals for three cryptographic primitives: block ciphers, stream ciphers, and hash functions. It provides an overview of the design principles of a...
198
click to vote
LATIN
2000
Springer
15 years 10 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
176
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
181
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...