Demo Data from SIGIR 2026 / reviewers in the wild / expert
Maurice Karnaugh
dblp:52/5915
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 3 first-authorArtificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 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.
| Software engineering, system software, and programming languages
1 paper |
Operating systems · 100% | |
| Computer networks
1 paper |
Network optimization and economics · 100% | |
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Operating systems
real-time systems |
0.0 | 1 | 1984 | YES/MVS: A Continuous Real Time Expert System · AAAI 1984 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › expert systems
rule-based expert systems |
0.0 | 1 | 1984 | YES/MVS: A Continuous Real Time Expert System · AAAI 1984 |
Methods — techniques the papers use, named apart from their topics
continuous real-time monitoring · 0.0second-order greedy algorithm · 0.0greedy algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | 1984 - and Still Counting
Maurice Karnaugh |
Comput. Networks | 1 |
| 1984 | YES/MVS: A Continuous Real Time Expert System
James H. Griesmer, Se June Hong, Maurice Karnaugh, John K. Kastner, Marshall I. Schor, Robert L. Ennis, David A. Klein, Keith R. Milliken, Hugo M. Van Woerkom |
AAAI | 3 |
| 1976 | A New Class of Algorithms for Multipoint Network OptimizationabstractA class of second-order greedy algorithms (SOGA) for the optimization of multipoint networks is defined that is capable of generating improved solutions to problems by an average of more than two percent, relative to the solutions generated by the Esau-Williams algorithm. These SOGA utilize repeated calls of a modified Esau-Williams procedure. They consequently take much longer to execute than does the Esau-Williams algorithm. Nevertheless, problems involving up to 400 points can be solved on a large computer, and 200-point problems can be solved on machines of intermediate size. Maurice Karnaugh |
IEEE Trans. Commun. | 1 |
| 1972 | Issues in Computer Communications
Maurice Karnaugh |
IEEE Trans. Commun. | 1 |