| Branching and pruning: An optimal temporal POCL planner based on constraint programming V Vidal, H Geffner Artificial Intelligence 170 (3), 298-335, 2006 | 266 | 2006 |
| A Lookahead Strategy for Heuristic Search Planning. V Vidal ICAPS, 150-160, 2004 | 183 | 2004 |
| Reasoning from last conflict (s) in constraint programming C Lecoutre, L Saïs, S Tabary, V Vidal Artificial Intelligence 173 (18), 1592-1614, 2009 | 73 | 2009 |
| Recording and minimizing nogoods from restarts C Lecoutre, L Sais, S Tabary, V Vidal Journal on Satisfiability, Boolean Modeling and Computation 1 (3-4), 147-167, 2006 | 69 | 2006 |
| Nogood Recording from Restarts. C Lecoutre, L Sais, S Tabary, V Vidal IJCAI 7, 131-136, 2007 | 59 | 2007 |
| YAHSP3 and YAHSP3-MT in the 8th International Planning Competition V Vidal 8th International Planning Competition (IPC-2014), 2014 | 54 | 2014 |
| YAHSP2: Keep it simple, stupid V Vidal Proceedings of the 7th International Planning Competition (IPC-2011), 83-90, 2011 | 53 | 2011 |
| An evolutionary metaheuristic based on state decomposition for domain-independent satisficing planning J Bibai, P Savéant, M Schoenauer, V Vidal Proceedings of the International Conference on Automated Planning and …, 2010 | 47 | 2010 |
| Divide-and-Evolve: a new memetic scheme for domain-independent temporal planning M Schoenauer, P Savéant, V Vidal European Conference on Evolutionary Computation in Combinatorial …, 2006 | 42 | 2006 |
| Least commitment in Graphplan M Cayrol, P Régnier, V Vidal Artificial Intelligence 130 (1), 85-118, 2001 | 38 | 2001 |
| Solving simple planning problems with more inference and no search V Vidal, H Geffner International Conference on Principles and Practice of Constraint …, 2005 | 37 | 2005 |
| Last conflict based reasoning C Lecoutre, L Sais, S Tabary, V Vidal ECAI, 133-137, 2006 | 34 | 2006 |
| Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning. V Vidal, L Bordeaux, Y Hamadi SOCS, 2010 | 30 | 2010 |
| HiPOP: Hierarchical Partial-Order Planning P Bechon, M Barbier, G Infantes, C Lesire, V Vidal The Seventh "Starting Artificial Intelligence Research" Symposium (STAIRS-2014), 2014 | 24 | 2014 |
| Extending classical planning heuristics to probabilistic planning with dead-ends F Teichteil-Königsbuch, V Vidal, G Infantes Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 2011 | 24 | 2011 |
| Divide-and-Evolve: the Marriage of Descartes and Darwin J Dréo, P Savéant, M Schoenauer, V Vidal 7th International Planning Competition (IPC'11), 2011 | 20 | 2011 |
| Divide-and-Evolve: a Sequential Hybridization Strategy using Evolutionary Algorithms M Schoenauer, P Savéant, V Vidal Advances in Metaheuristics for Hard Optimization, 179-198, 2007 | 20 | 2007 |
| Pareto-based multiobjective AI planning MR Khouadjia, M Schoenauer, V Vidal, J Dréo, P Savéant IJCAI 2013, 2321-2327, 2013 | 18 | 2013 |
| On the benefit of sub-optimality within the divide-and-evolve scheme J Bibai, P Savéant, M Schoenauer, V Vidal European Conference on Evolutionary Computation in Combinatorial …, 2010 | 16 | 2010 |
| Transposition tables for constraint satisfaction C Lecoutre, L Sais, S Tabary, V Vidal PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE 22 (1), 243, 2007 | 16 | 2007 |
Marc SchoenauerSenior Researcher, INRIAVerified email at inria.fr
