Ananth Grama, Vipin Kumar  Home/Search
Context
Related
| purdue.edu/homes/ayg/ISAC/dop7.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: purdue.edu/homes/ayg/isac (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Discrete optimization problems arise in a variety of domains such as VLSI design, transportation, scheduling and management, and design optimization. Very often, these problems are solved using state space search techniques. Due to the high computational requirements and inherent parallel nature of search techniques, there has been a great deal of interest in the development of parallel search methods since the dawn of parallel computing. Significant advances have been made in the use of... (Update)
Similar documents (at the sentence level):
7.3%: Load Balancing for Parallel Optimization Techniques - Grama, Kumar (Correct)
5.3%: A Survey of Parallel Search Algorithms for Discrete.. - Grama, Kumar (1993) (Correct)
Active bibliography (related documents): More All
1.0: Parallel Processing of Discrete Optimization Problems - Ananth, Kumar, Pardalos (1992) (Correct)
0.5: Portable Distributed Priority Queues with MPI - Mans (1995) (Correct)
0.5: Constructive Genetic Algorithm for Clustering Problems - Lorena, al. (1998) (Correct)
Similar documents based on text: More All
0.2: An Efficient Protocol for Yao's Millionaires' Problem - Ioannis Ioannidis And (Correct)
0.2: Efficient Caching for IP Lookups - Ioannidis, Grama (2004) (Correct)
0.1: On Architecture Independent Design and Analysis of.. - Grama, Kumar, Ranka.. (Correct)
BibTeX entry: (Update)
@article{ grama99state,
author = "Ananth Grama and Vipin Kumar",
title = "State of the Art in Parallel Search Techniques for Discrete Optimization Problems",
journal = "Knowledge and Data Engineering",
volume = "11",
number = "1",
pages = "28-35",
year = "1999",
url = "citeseer.ist.psu.edu/362139.html" }
Citations (may not include all citations):266 Heuristics-Intelligent Search Strategies for Computer Proble.. (context) - Pearl - 1984
105 A branch-and-cut algorithm for the resolution of large-scale.. (context) - Padberg, Rinaldi - 1991
75 Derivation of a termination detection algorithm for a distri.. (context) - Dijkstra, Seijen et al. - 1983
75 Scalable load balancing techniques for parallel computers - Kumar, Grama et al. - 1994
48 Concurrent access of priority queues - Rao, Kumar - 1988
46 Anomalies in parallel branch and bound algorithms - Lai, Sahni - 1984
46 Parallel search of strongly ordered game trees - Marsland, Campbell - 1982
42 Randomized parallel algorithms for backtrack search and bran.. (context) - Karp, Zhang - 1993
38 Optimal speedup for backtrack search on a butterfly network (context) - Ranade - 1991
37 ACM Transactions of Programming Languages and Systems (context) - Finkel, Manber et al. - 1987
36 Unstructured Tree Search on SIMD Parallel Computers - Karypis, Kumar - 1994
32 Search in Artificial Intelligence (context) - Kanal, Kumar - 1988
26 Multiprocessing of combinatorial search problems (context) - Wah, Li et al. - 1985
24 A general branch-and-bound formulations for understanding an.. (context) - Kumar, Kanal - 1983
21 Introduction to Parallel Computing: Algorithm Design and Ana.. (context) - Kumar, Grama et al. - 1994
20 Distributed tree search and its application to alpha-beta pr.. (context) - Ferguson, Korf - 1988
18 Large scale parallelization of alpha-beta search: An algorit.. - Hsu - 1990
18 A parallel branch and bound algorithm for the quadratic assi.. (context) - Roucairol - 1987
17 IEEE Transactions on Parallel and Distributed Systems (context) - Rao, Kumar et al. - 1993
14 A multi-level load balancing scheme for OR-parallel exhausti.. (context) - Furuichi, Taki et al. - 1990
14 Studying overheads in massively parallel min/max-tree evalua.. (context) - Monien, Feldmann et al. - 1994
13 Scalable load-balancing strategies for parallel a* algorithm.. - Dutt, Mahapatra - 1994
13 MANIP---a multicomputer architecture for solving combinatori.. (context) - Wah, Ma - 1984
13 Lower bounds for the quadratic assignment problem - Pardalos, Li et al. - 1994
10 A randomized parallel backtracking algorithm (context) - Janakiram, Agrawal et al. - 1988
9 A memory-limited heuristic search procedure for the connecti.. (context) - Evett, Hendler et al. - 1990
9 BOB: A unified platform for implementing branch-and-bound li.. - Cun, Roucairol - 1995
8 Probabilistic performance analysis of heuristic search using.. (context) - Manzini, Somalvico - 1990
7 Deep Blue's hardware-software synergy (context) - Hamilton, Garber - 1997
7 Solving Combinatorial Optimization Problems in Parallel: Met.. (context) - Ferreira, Pardalos - 1996
6 Parallel state-space search for a first solution with consis.. (context) - Kale, Saletore - 1990
6 Floorplan optimization on multiprocessors (context) - Arvindam, Kumar et al. - 1989
5 Distributed versus centralized storage and control for paral.. (context) - Eckstein - 1997
5 Computational efficiency of combinatorial or-tree searches (context) - Li, Wah - 1990
4 Center for Research on Parallel Computation (context) - Bixby, Cook et al. - 1995
4 Coping with anomalies in parallel branch-and-bound algorithm.. (context) - Li, Wah - 1986
4 Parallel branch-and-boundmethods for mixed-integer programmi.. (context) - Eckstein - 1994
3 Computational experience of an interior-point algorithm in a.. (context) - Lee, Mitchell - 1997
3 An inherently parallel method for heuristic problem-solving:.. (context) - Pramanick, Kuhl - 1995
3 Performances of parallel branch and bound algorithms with be.. - Mans, Roucairol - 1996
3 Scalable global and local hashing strategies for duplicate p.. - Mahapatra, Dutt - 1997
3 Solving the traveling salesman problem with a distributed br.. (context) - Monien, Tschvke et al. - 1995
3 Deep Blue system overview (context) - Hsu, Campbell et al. - 1995
2 Georgia Institute of Technology (context) - Johnson, Nemhauser et al. - 1997
2 A parallel depth first search branch and bound for the quadr.. (context) - Mans, Mautor et al. - 1995
2 Solving large-scale qap problems in parallel with the search.. - Brungger, Marzetta et al. - 1998
1 The role of performance metrics for parallel mathematical pr.. (context) - Miller, Pekny - 1993
Documents on the same site (http://www.cs.purdue.edu/homes/ayg/isac.html): More
Load Balancing for Parallel Optimization Techniques - Grama, Kumar (Correct)
Improving Error Bounds for Multipole-Based Treecodes - Grama, Sarin, Sameh (Correct)
Improving Error Bounds for Multipole-Based Treecodes - Grama, Sarin, Sameh (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC