Suivre
Vincent Vidal
Vincent Vidal
Research Scientist, Onera
Adresse e-mail validée de onera.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Branching and pruning: An optimal temporal POCL planner based on constraint programming
V Vidal, H Geffner
Artificial Intelligence 170 (3), 298-335, 2006
2832006
A Lookahead Strategy for Heuristic Search Planning.
V Vidal
ICAPS, 150-160, 2004
1842004
Reasoning from last conflict (s) in constraint programming
C Lecoutre, L Saïs, S Tabary, V Vidal
Artificial Intelligence 173 (18), 1592-1614, 2009
1052009
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
872006
Nogood Recording from Restarts.
C Lecoutre, L Sais, S Tabary, V Vidal
IJCAI 7, 131-136, 2007
682007
YAHSP3 and YAHSP3-MT in the 8th International Planning Competition
V Vidal
8th International Planning Competition (IPC-2014), 2014
652014
YAHSP2: Keep it simple, stupid
V Vidal
Proceedings of the 7th International Planning Competition (IPC-2011), 83-90, 2011
532011
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
472010
Last conflict based reasoning
C Lecoutre, L Sais, S Tabary, V Vidal
ECAI, 133-137, 2006
452006
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
422014
Least commitment in Graphplan
M Cayrol, P Régnier, V Vidal
Artificial Intelligence 130 (1), 85-118, 2001
422001
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
412006
Solving simple planning problems with more inference and no search
V Vidal, H Geffner
International Conference on Principles and Practice of Constraint …, 2005
382005
Adaptive k-parallel best-first search: A simple but efficient algorithm for multi-core domain-independent planning
V Vidal, L Bordeaux, Y Hamadi
Proceedings of the International Symposium on Combinatorial Search 1 (1 …, 2010
372010
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), 1017-1022, 2011
302011
Seed retention by pioneer trees enhances plant diversity resilience on gravel bars: Observations from the river Allier, France
D Corenblit, V Vidal, M Cabanis, J Steiger, V Garófano-Gómez, A Garreau, ...
Advances in Water Resources 93, 182-192, 2016
252016
Pareto-based multiobjective AI planning
MR Khouadjia, M Schoenauer, V Vidal, J Dréo, P Savéant
IJCAI 2013, 2321-2327, 2013
222013
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
212011
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, 2008
192008
The YAHSP planning system: Forward heuristic search with lookahead plans analysis
V Vidal
International Planning Competition, 56, 2004
182004
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20