Demo Data from SIGIR 2026 / reviewers in the wild / expert
Michael E. Samples
dblp:77/1624
· DBLP profile ↗
5ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 1 first-authorGraphics, 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.
| Artificial intelligence
1 paper |
Planning, search and constraint satisfaction · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable markov decision process |
0.1 | 1 | 2007 | Improving Anytime Point-Based Value Iteration Using Principled Point Selections · IJCAI 2007 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
point-based value iteration |
0.1 | 1 | 2007 | Improving Anytime Point-Based Value Iteration Using Principled Point Selections · IJCAI 2007 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Improving Anytime Point-Based Value Iteration Using Principled Point Selections
Michael R. James 0001, Michael E. Samples, Dmitri A. Dolgov |
IJCAI | 2 |
| 2006 | Evolving a real-world vehicle warning systemabstractMany serious automobile accidents could be avoided if drivers were warned of impending crashes before they occur. Creating such warning systems by hand, however, is a difficult and time-consuming task. This paper describes three advances toward evolving neural networks with NEAT (NeuroEvolution of Augmenting Topologies) to warn about such crashes in real-world environments. First, NEAT was evaluated in a complex, dynamic simulation with other cars, where it outperformed three hand-coded strawman warning policies and generated warning levels comparable with those of an open-road warning system. Second, warning networks were trained using raw pixel data from a simulated camera. Surprisingly, NEAT was able to generate warning networks that performed similarly to those trained with higher-level input and still outperformed the baseline hand-coded warning policies. Third, the NEAT approach was evaluated in the real world using a robotic vehicle testbed. Despite noisy and ambiguous sensor data, NEAT successfully evolved warning networks using both laser rangefinders and visual sensors. The results in this paper set the stage for developing warning networks for real-world traffic, which may someday save lives in real vehicles. Nate Kohl, Kenneth O. Stanley, Risto Miikkulainen, Michael E. Samples, Rini Sherony |
GECCO | 4 |
| 2005 | Probing for limits to building block mixing with a tunably-difficult problem for genetic programmingabstractThis paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be used to garner insight into the dynamics of what happens during the course of a GP run. The results indicate that the amount of mixing is fairly low in comparison to the amount of content that could be present in an initial population. Jason M. Daida, Michael E. Samples, Matthew J. Byom |
GECCO | 2 |
| 2005 | Parameter sweeps for exploring GP parametersabstractNo abstract available. Michael E. Samples, Jason M. Daida, Matthew J. Byom, Matt Pizzimenti |
GECCO | 1 |
| 2004 | Demonstrating constraints to diversity with a tunably difficult problem for genetic programmingabstractThis work introduces a tunably difficult problem for genetic programming (GP) that probes for an upper bound to the amount of heterogeneity that can be represented by a single individual. Although GP's variable-length representation would suggest that there is no upper bound, our results indicate otherwise. The results provide insight into the dynamics that occur during the course of a GP run. Jason M. Daida, Michael E. Samples, Bryan T. Hart, Jeffry Halim |
IEEE Congress on Evolutionary Computation | 2 |