| Stochastic Local Search over Minterms on Structured SAT Instances. | 0 | 0.34 | 2016 |
| From the user's perspective: Perceptions of risk relative to benefit associated with using the Internet. | 0 | 0.34 | 2016 |
| Use of explicit memory in the dynamic traveling salesman problem | 4 | 0.40 | 2014 |
| Evaluating Diversity in Classical Planning. | 1 | 0.35 | 2014 |
| Automated Extraction of Vulnerability Information for Home Computer Security. | 1 | 0.36 | 2014 |
| Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time | 15 | 0.97 | 2012 |
| Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search | 6 | 0.47 | 2011 |
| A Critical Assessment of Benchmark Comparison in Planning | 0 | 0.34 | 2011 |
| Revisiting the big valley search space structure in the TSP | 18 | 0.85 | 2011 |
| Evaluating Multi-Agent Traffic Controllers | 0 | 0.34 | 2010 |
| Directed Plateau Search for MAX-k-SAT. | 8 | 0.62 | 2010 |
| Proceedings of the 19th International Conference on Automated Planning and Scheduling, ICAPS 2009, Thessaloniki, Greece, September 19-23, 2009 | 53 | 3.47 | 2009 |
| What Makes Planners Predictable?. | 9 | 0.48 | 2008 |
| Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling | 1 | 0.36 | 2007 |
| Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules | 0 | 0.34 | 2006 |
| A variational inference procedure allowing internal structure for overlapping clusters and deterministic constraints | 10 | 0.80 | 2006 |
| Modeling Search for Scheduling. | 0 | 0.34 | 2006 |
| Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems | 1 | 0.37 | 2006 |
| Linking search space structure, run-time dynamics, and problem difficulty: a step toward demystifying tabu search | 15 | 0.91 | 2005 |
| CIXL2: a crossover operator for evolutionary algorithms based on population features | 57 | 8.50 | 2005 |
| Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem | 15 | 1.08 | 2004 |
| Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search | 16 | 1.04 | 2002 |
| Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance | 58 | 4.03 | 2002 |
| Evaluating Robustness in a Two Layer Simulated Robot Architecture | 0 | 0.34 | 2000 |
| Planner Based Error Recovery Testing | 3 | 0.37 | 2000 |
| Exploiting Competitive Planner Performance | 25 | 1.19 | 1999 |
| Algorithm performance and problem structure for flow-shop scheduling | 18 | 1.79 | 1999 |
| A Parallel Algorithm for POMDP Solution | 2 | 0.39 | 1999 |
| Learning to Race: Experiments with a Simulated Race Car | 8 | 0.74 | 1998 |
| The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt | 28 | 1.80 | 1998 |
| Program understanding behaviour during enhancement of large-scale software | 40 | 3.05 | 1997 |
| Modelling Discrete Event Sequences as State Transition Diagrams | 2 | 0.55 | 1997 |
| SAVVYSEARCH: A Metasearch Engine That Learns Which Search Engines to Query | 84 | 17.23 | 1997 |
| Modeling Intelligent System Execution as State Transition Diagrams to Support Debugging | 1 | 0.57 | 1997 |
| Comparing Heuristic, Evolutionary and Local Search Approaches to Scheduling | 7 | 0.91 | 1996 |
| Constructing Transition Models of AI Planner Behavior | 2 | 0.47 | 1996 |
| Detecting Imperfect Patterns in Event Streams Using Local Search. | 3 | 0.55 | 1995 |
| Understanding planner behavior | 14 | 2.08 | 1995 |
| Analyzing Failure Recovery to Improve Planner Design | 6 | 2.72 | 1992 |
| Addressing Real-Time Constraints in the Design of Autonomous Agents. | 0 | 0.34 | 1990 |
| Toward AI research methodology: three case studies in evaluation | 17 | 2.04 | 1989 |
| How Evaluation Guides AI Research: The Message Still Counts More than the Medium | 13 | 1.46 | 1988 |
