Demo Data from SIGIR 2026 / reviewers in the wild / expert
Monte Zweben
dblp:50/4393
· DBLP profile ↗
6ranked-venue papers
4as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author
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
5 papers |
Planning, search and constraint satisfaction · 94% Reinforcement learning · 6% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › scheduling
constraint-based scheduling |
0.0 | 2 | 1992 | Learning to Improve Constraint-Based Scheduling · Artif. Intell. 1992 Learning Search Control for Constraint-Based Scheduling · AAAI 1990 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
scheduling |
0.0 | 1 | 1993 | Informedness vs. Computational Cost of Heuristics in Iterative Repair Scheduling · IJCAI 1993 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › search control
search control learning |
0.0 | 1 | 1990 | Learning Search Control for Constraint-Based Scheduling · AAAI 1990 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
search control |
0.0 | 1 | 1989 | Approximating Learned Search Control Knowledge · ML 1989 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
heuristic search |
0.0 | 1 | 1993 | Informedness vs. Computational Cost of Heuristics in Iterative Repair Scheduling · IJCAI 1993 |
Methods — techniques the papers use, named apart from their topics
iterative repair · 0.0machine learning · 0.0machine learning for search control · 0.0delayed evaluation · 0.0approximation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | Informedness vs. Computational Cost of Heuristics in Iterative Repair Scheduling
Monte Zweben, Eugene Davis, Brian Daun, Michael Deale |
IJCAI | 1 |
| 1993 | Scheduling and rescheduling with iterative repairabstractThe GERRY scheduling and rescheduling system being applied to coordinate Space Shuttle ground processing is described. The system uses constraint-based iterative repair, a technique that starts with a complete but possibly flawed schedule and iteratively improves it by using constraint knowledge within repair heuristics. The tradeoff between the informedness and the computational cost of several repair heuristics is explored. It is shown empirically that some knowledge can greatly improve the convergence speed of a repair-based system, but that too much knowledge can overwhelm a system and result in degraded performance.> Monte Zweben, Eugene Davis, Brian Daun, Michael Deale |
IEEE Trans. Syst. Man Cybern. | 1 |
| 1992 | Learning to Improve Constraint-Based Scheduling
Monte Zweben, Eugene Davis, Brian Daun, Ellen Drascher, Michael Deale, Megan Eskey |
Artif. Intell. | 1 |
| 1990 | Learning Search Control for Constraint-Based Scheduling
Megan Eskey, Monte Zweben |
AAAI | 2 |
| 1989 | Approximating Learned Search Control Knowledge
Melissa P. Chase, Monte Zweben, Richard L. Piazza, John D. Burger, Paul P. Maglio, Haym Hirsh |
ML | 2 |
| 1989 | Constraint Satisfaction with Delayed Evaluation
Monte Zweben, Megan Eskey |
IJCAI | 1 |