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

James B. Perkins

dblp:82/11228 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none

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

Artificial intelligence and machine learning · 2Systems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 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
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed scheduling
0.011991
Distributed scheduling of job shops · ICRA 1991
Distributed systems
distributed implementation
0.011991
Distributed scheduling of job shops · ICRA 1991

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

local area network distribution · 0.0
YearPublicationVenuePosition
1991 Determination of ventricular structure from multisignature MR images of the brain
abstract
The derivation of ventricular structures from a pediatric population is discussed. The original dataset is classified via a metric-based clustering algorithm which is tuned to the signature distribution from the magnetic resonance images (MRIs). The cluster set (or sets) interpreted as cerebrospinal fluid are aggregated throughout the dataset into a group of connected components whose topology is understood. This typically recursive procedure is replaced by a divide-and-conquer approach which substantially reduces the stack space needed for the aggregation. Other class sets can be equivalently aggregated. Visualization and geometry are then simply deduced from the aggregated cluster sets in the data. It is demonstrated how this hierarchical cluster/classification strategy can successfully demonstrate ventricular structure from multisignature MRIs.>
Ian R. Greenshields, Francis DiMario, Gale Ramsby, James B. Perkins
CBMS4
1991 Distributed scheduling of job shops
abstract
A distributed job shop scheduling algorithm has been implemented in the LAN (local area network) environment. The algorithm is a good candidate for distributed implementation since much of the computation time required for a solution is expended in distributable portions of the algorithm. A distributed processing support system (DPSS) was developed to ease the implementation of this and future distributed algorithms. Preliminary results indicate considerable potential for reducing the computation time. Additional portions of the algorithm may be distributed to improve the results, and streamlining of the underlying communication mechanism of DPSS is underway.>
Debra J. Hoitomt, James B. Perkins, Peter B. Luh
ICRA2