2008 |
17 | EE | Marc Schoenauer,
Pierre Savéant,
Vincent Vidal:
Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms.
Advances in Metaheuristics for Hard Optimization 2008: 179-198 |
2007 |
16 | | Christophe Lecoutre,
Lakhdar Sais,
Sébastien Tabary,
Vincent Vidal:
Transposition Tables for Constraint Satisfaction.
AAAI 2007: 243-248 |
15 | EE | Christophe Lecoutre,
Lakhdar Sais,
Sébastien Tabary,
Vincent Vidal:
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance.
CP 2007: 453-467 |
14 | EE | Christophe Lecoutre,
Lakhdar Sais,
Sébastien Tabary,
Vincent Vidal:
Nogood Recording from Restarts.
IJCAI 2007: 131-136 |
13 | EE | Christophe Lecoutre,
Lakhdar Sais,
Sébastien Tabary,
Vincent Vidal:
Recording and Minimizing Nogoods from Restarts.
JSAT 1(3-4): 147-167 (2007) |
2006 |
12 | | Christophe Lecoutre,
Lakhdar Sais,
Sébastien Tabary,
Vincent Vidal:
Last Conflict Based Reasoning.
ECAI 2006: 133-137 |
11 | EE | Marc Schoenauer,
Pierre Savéant,
Vincent Vidal:
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning.
EvoCOP 2006: 247-260 |
10 | | Zied Loukil,
Abdelmajid Ben Hamadou,
Pierre Marquis,
Vincent Vidal:
Les ressources et la planification temporelle.
INFORSID 2006: 515-529 |
9 | EE | Vincent Vidal,
Hector Geffner:
Branching and pruning: An optimal temporal POCL planner based on constraint programming.
Artif. Intell. 170(3): 298-335 (2006) |
8 | EE | Marc Schoenauer,
Pierre Savéant,
Vincent Vidal:
Divide-and-Evolve: a New Memetic Scheme for Domain-Independent Temporal Planning
CoRR abs/cs/0601031: (2006) |
2005 |
7 | EE | Vincent Vidal,
Hector Geffner:
Solving Simple Planning Problems with More Inference and No Search.
CP 2005: 682-696 |
2004 |
6 | | Vincent Vidal,
Hector Geffner:
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming.
AAAI 2004: 570-577 |
5 | | Vincent Vidal:
A Lookahead Strategy for Heuristic Search Planning.
ICAPS 2004: 150-160 |
2003 |
4 | | Vincent Vidal:
A lookahead strategy for solving large planning problems.
IJCAI 2003: 1524-1525 |
2001 |
3 | EE | Michel Cayrol,
Pierre Régnier,
Vincent Vidal:
Least commitment in Graphplan.
Artif. Intell. 130(1): 85-118 (2001) |
2000 |
2 | | Michel Cayrol,
Pierre Régnier,
Vincent Vidal:
New Results about LCGP, a Least Committed GraphPlan.
AIPS 2000: 273-282 |
1999 |
1 | | Vincent Vidal,
Pierre Régnier:
Total Order Planning is More Efficient than we Thought.
AAAI/IAAI 1999: 591-596 |