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

J. Denbigh Starkey

dblp:s/JDenbighStarkey · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

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

Human-computer interaction and ubiquitous computing · 4 · 1 first-authorArtificial intelligence and machine learning · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 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.

Artificial intelligence
2 papers
Planning, search and constraint satisfaction · 100%
Software engineering, system software, and programming languages
1 paper
Concurrent programming · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Human-computer interaction and pervasive computing
1 paper
Games and playful interaction · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game tree search
0.021979
The X-0-0 Heuristic in Game Tree Analysis · IJCAI 1979
Tree Analysis Techniques in Tsumego · IJCAI 1979
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game playing
0.011979
The X-0-0 Heuristic in Game Tree Analysis · IJCAI 1979
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search
heuristic evaluation
0.011979
The X-0-0 Heuristic in Game Tree Analysis · IJCAI 1979
Games and playful interaction
board games
0.011979
Tree Analysis Techniques in Tsumego · IJCAI 1979

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

concurrent programming · 0.0tree analysis · 0.0
YearPublicationVenuePosition
1997 An accelerated introductory computer science course sequence for non-traditional Master's students
abstract
All Computer Science Departments that offer graduate degrees share a common problem---many students, with degrees in other disciplines, apply to pursue a Master's degree in Computer Science, but have to make up a large number of undergraduate deficiencies before taking graduate classes. These students are typically above traditional age, have jobs and families, and cannot easily afford to make the time commitment that is necessary to be able to complete the deficiencies before taking the classes that become their graduate program. The Computer Science Department at Montana State University has a solution to this problem.We have developed two accelerated introductory courses, CS 252 and 254, where enrollment is restricted to students who already have degrees in other disciplines. These classes, which have two lectures and six hours of laboratory work each week, replace 26 semester credits of regular coursework, and let potential graduate students remove their required undergraduate deficiencies about a year faster than would otherwise be possible.
J. Denbigh Starkey, Ray S. Babcock, Anne S. DeFrance
SIGCSE1
1994 A heuristic to isolate interfering bodies in the BNCT treatment planning system
abstract
In many real life applications involving geometries, a problem may arise if any two objects are intersecting where they should not be. This paper presents a solution to this problem. The particular application discussed here is BNCT (Boron Neutron Capture Therapy) which is an idealized form of radiation therapy providing a mechanism to destroy cancer cells with minimal damage to adjacent normal cells. The radiation treatment planning software (BNCT Rtpe) uses NURBS to represent various anatomical surfaces. For the successful working of the Monte Carlo simulation of neutron transport, no two bodies should intersect in this representation. There always exists the possibility that two or more objects intersect. This paper presents a heuristic to isolate any two given interfering bodies (represented as closed B-spline surfaces). It finds a vector, based on the region of intersection, along which one of the surfaces can be moved to minimally isolate it from the other surface. It successfully isolates the two surfaces while preserving the original shapes and relative orientation of the two surfaces. Future work involved truncation of the surfaces midway between the regions of intersection.>
Rajeev Chawla, J. Denbigh Starkey, Ray S. Babcock, Daniel E. Wessol
CBMS2
1994 A methodology for teaching an integrated computer science curriculum
abstract
Article Free Access Share on A methodology for teaching an integrated computer science curriculum Authors: John T. Paxton Computer Science Department, Montana State University, Bozeman, MT Computer Science Department, Montana State University, Bozeman, MTView Profile , Rockford J. Ross Computer Science Department, Montana State University, Bozeman, MT Computer Science Department, Montana State University, Bozeman, MTView Profile , J. Denbigh Starkey Computer Science Department, Montana State University, Bozeman, MT Computer Science Department, Montana State University, Bozeman, MTView Profile Authors Info & Claims SIGCSE '94: Proceedings of the twenty-fifth SIGCSE symposium on Computer science educationMarch 1994 Pages 1–5https://doi.org/10.1145/191029.191034Online:12 March 1994Publication History 23citation335DownloadsMetricsTotal Citations23Total Downloads335Last 12 Months18Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
John T. Paxton, Rockford J. Ross, J. Denbigh Starkey
SIGCSE3
1984 A Concurrent General Purpose Operator Interface
abstract
Compact interactive control consoles are rephcing traditional control rooms as operator interfaces for physical processes. In the irust major application of concurrent programming outside the area of operating systems, this paper presents a design for a general purpose operator interface which uses a color graphics terminal with a touch-sensitive screen as the control console. Operators interact with a process through a collection of application-dependent displays generated interactively by users familiar with the physical process. The use of concurrent programming results in a straightforward and reliable design which may easily be extended to support multiple devices of varying types in the control console. An implementation of the Operator Interface in Concurrent Pascal currently in progress is also discussed.
Neil B. Corrigan, J. Denbigh Starkey
IEEE Trans. Software Eng.2
1979 Tree Analysis Techniques in Tsumego
David B. Benson, Bruce R. Hilditch, J. Denbigh Starkey
IJCAI3
1979 The X-0-0 Heuristic in Game Tree Analysis
J. Denbigh Starkey
IJCAI1
1977 SESPOOL, A Language for Systems Programming
Glen E. Newton, J. Denbigh Starkey
Comput. Lang.2
1976 Teaching both PL/I and Fortran to beginners
abstract
The overall approach to programming languages taken in the course is to use PL/I (with the PL/C compiler) during the first part of the semester to introduce programming concepts and techniques, then teach Fortran (with the WATFIV compiler) during the last part of the semester [2,3]. Except for a brief discussion of conventional flowcharts to help students read the examples in the texts, Nassi-Shneiderman structured flowcharts are used throughout the lectures and labs [4]. Algorithms are written in PL/I using DO-WHILE as the primary control structure, and GOTOs are not introduced except in Fortran.
Glen E. Newton, J. Denbigh Starkey
SIGCSE2
1976 Experimental tests of resolution-based theorem-proving strategies
J. Dennis Lawrence, J. Denbigh Starkey
Inf. Sci.2