On schemata and systems for parallel algorithms
Georg Gati (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The complexity of the travelling repairman problem”
On schemata and systems for parallel algorithms
On the application of insertion techniques for job shop problems with setup times
Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Open shop scheduling with delays
V. J. Rayward-Smith, D. Rebaine (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Two methods for multicriteria hierarchization of discrete alternatives
Gheorghe Păun (1984)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
An exact method for solving the multi-processor flow-shop
Jacques Carlier, Emmanuel Néron (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On generating all solutions of generalized satisfiability problems
N. Creignou, J.-J. Hebrard (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Monotonous and randomized reductions to sparse sets
V. Arvind, J. Köbler, M. Mundhenk (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On sets bounded truth-table reducible to -selective sets
Thomas Thierauf, Seinosuke Toda, Osamu Watanabe (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: