Search the dblp DataBase

Publications of Author

1. Vincent Vidal, Hector Geffner
   Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming. [Citation Graph (0, 0)][DBLP]
   AAAI, 2004, pp:570-577 [Conf]
   
2. Vincent Vidal, Pierre Régnier
   Total Order Planning is More Efficient than we Thought. [Citation Graph (0, 0)][DBLP]
   AAAI/IAAI, 1999, pp:591-596 [Conf]
   
3. Michel Cayrol, Pierre Régnier, Vincent Vidal
   New Results about LCGP, a Least Committed GraphPlan. [Citation Graph (0, 0)][DBLP]
   AIPS, 2000, pp:273-282 [Conf]
   
4. Vincent Vidal
   A Lookahead Strategy for Heuristic Search Planning. [Citation Graph (0, 0)][DBLP]
   ICAPS, 2004, pp:150-160 [Conf]
   
5. Vincent Vidal, Hector Geffner
   Solving Simple Planning Problems with More Inference and No Search. [Citation Graph (0, 0)][DBLP]
   CP, 2005, pp:682-696 [Conf]
   
6. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
   Last Conflict Based Reasoning. [Citation Graph (0, 0)][DBLP]
   ECAI, 2006, pp:133-137 [Conf]
   
7. Marc Schoenauer, Pierre Savéant, Vincent Vidal
   Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning. [Citation Graph (0, 0)][DBLP]
   EvoCOP, 2006, pp:247-260 [Conf]
   
8. Vincent Vidal
   A lookahead strategy for solving large planning problems. [Citation Graph (0, 0)][DBLP]
   IJCAI, 2003, pp:1524-1525 [Conf]
   
9. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
   Nogood Recording from Restarts. [Citation Graph (0, 0)][DBLP]
   IJCAI, 2007, pp:131-136 [Conf]
   
10. Zied Loukil, Abdelmajid Ben Hamadou, Pierre Marquis, Vincent Vidal
    Les ressources et la planification temporelle. [Citation Graph (0, 0)][DBLP]
    INFORSID, 2006, pp:515-529 [Conf]
    
11. Michel Cayrol, Pierre Régnier, Vincent Vidal
    Least commitment in Graphplan. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:130, n:1, pp:85-118 [Journal]
    
12. Vincent Vidal, Hector Geffner
    Branching and pruning: An optimal temporal POCL planner based on constraint programming. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2006, v:170, n:3, pp:298-335 [Journal]
    
13. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
    Transposition Tables for Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:243-248 [Conf]
    
14. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
    Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:453-467 [Conf]
    
15. Marc Schoenauer, Pierre Savéant, Vincent Vidal
    Divide-and-Evolve: a New Memetic Scheme for Domain-Independent Temporal Planning [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
16. 
    An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning. [Citation Graph (, )][DBLP]
    
    
17. 
    On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme. [Citation Graph (, )][DBLP]
    
    
18. 
    On the generality of parameter tuning in evolutionary planning. [Citation Graph (, )][DBLP]
    
    
19. 
    Reasoning from last conflict(s) in constraint programming. [Citation Graph (, )][DBLP]