default search action
DIMACS Workshop: Workshop on Parallel Processing of Discrete Optimization Problems 1994
- Panos M. Pardalos, Mauricio G. C. Resende, K. G. Ramakrishnan:
Workshop on Parallel Processing of Discrete Optimization Problems, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 28-29, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 22, DIMACS/AMS 1995, ISBN 978-0-8218-0240-3 - Foreword. Parallel Processing of Discrete Optimization Problems 1994: xi-
- Preface. Parallel Processing of Discrete Optimization Problems 1994: xiii-
- Costas Busch, Marios Mavronicolas:
Proving Correctness for Balancing Networks. 1-32 - Andrea Clemnti, José Rolim, Ludek Kucera:
A Note on Parallel Randomized Algorithms for Searching Problems. 33-43 - Ricardo C. Corrêa, Afonso Ferreira:
Modeling Parallel Branch-and-Bound for Asynchronous Implementations. 45-56 - Olof Damberg, Athanasios Migdalas:
A Data Parallel Space Dilation Algorithm for the Concentrator Location Problem. 57-80 - Apostolos Gerasoulis, Jia Jiao, Tao Yang:
A Multistage Approach for Scheduling Task Graphs on Parallel Machines. 81-103 - Jun Gu:
Parallel Algorithms for Satisfiability (SAT) Problem. 105-161 - George Karypis, Anshul Gupta, Vipin Kumar:
Experiences with a Parallel Formulation of an Interior Point Algorithm. 163-180 - Per S. Laursen:
Experiences with a Synchronous Parallel Branch and Bound Algorithm. 181-195 - Nihar R. Mahapatra, Shantanu Dutt:
New Anticipatory Load Balancing Strategies for Parallel A* Algorithms. 197-232 - Boleslaw Mikolajczak:
A Parallel Algorithm for Computing all Homomorphisms of Deterministic Finite Automata. 233-257 - Thomas M. Niccum, Jaideep Srivastava, Bhaskar Himatsingka, Jianzhong Li:
Query Optimization and Processing in Parallel Databases. 259-287 - Santosh Pande, Kleanthis Psarris:
Scheduling Acyclic Task Graphs on Distributed Memory Parallel Architectures. 289-304 - Alexander Reinefeld:
Sclability of Massively Parallel Depth-First Search. 305-322 - Catherine Roucairol:
On Irregular Data Structures and Asynchronous Parallel Brand and Bound Algorithms. 323-336 - Christian Schutt, Jens Clausen:
Parallel Algorithms for the Assignment Problem - An Experimental Evaluation of Three Distributed Algorithms. 337-351 - J. MacGregor Smith, Kui Xu:
Serial & Parallel Algorithms for QSP Problems. 353-374
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.