Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

James V. Crouse

dblp:125/2400 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 77% Processor architecture and microarchitecture · 23%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms › parallel search
parallel combinatorial search		 0.011989
A parallel algorithm for the quadratic assignment problem · SC 1989
Mathematical optimization › combinatorial optimization › assignment problem
quadratic assignment problem		 0.011989
A parallel algorithm for the quadratic assignment problem · SC 1989
Processor architecture and microarchitecture › vector processor
vector multiprocessor		 0.011989
A parallel algorithm for the quadratic assignment problem · SC 1989

Methods — techniques the papers use, named apart from their topics

vectorization · 0.0branch-and-bound · 0.0
YearPublicationVenuePosition
1989 A parallel algorithm for the quadratic assignment problem
abstract
In this paper we present a parallel branch and bound algorithm for the solution of quadratic assignment problems. The algorithm has been coded in VS/FORTRAN and run on an IBM 3090-400E vector multiprocessor. The algorithm is exact and finds all the solutions. Computational results on a variety of test problems are presented.
Panos M. Pardalos, James V. Crouse
 SC2