default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Vidal 0001
Person information
- affiliation: ONERA-DCSD, Toulouse, France
- affiliation (former): Academic Institute of Technology of Lens, France
- affiliation (former): University of Artois, France
- affiliation (former): University Paul Sabatier, Toulouse, France
Other persons with the same name
- Vincent Vidal — disambiguation page
- Vincent Vidal 0002 — INRIA - Evasion, France (and 1 more)
- Vincent Vidal 0003 — University of Paris, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c30]Marvin Stanczak, Cédric Pralet, Vincent Vidal, Vincent Baudoui:
A Pipe Routing Hybrid Approach Based on A-Star Search and Linear Programming. CPAIOR 2021: 179-195- 2020
- [c29]Marvin Stanczak, Cédric Pralet, Vincent Vidal, Vincent Baudoui:
Optimal Pipe Routing Techniques in an Obstacle-Free 3D Space. ICORES 2020: 69-79 - [p2]Régis Sabbadin, Florent Teichteil-Königsbuch, Vincent Vidal:
Planning in Artificial Intelligence. A Guided Tour of Artificial Intelligence Research (2) (II) 2020: 285-312
2010 – 2019
- 2016
- [c28]Eliott Roynette, Bertrand Cabon, Cédric Pralet, Vincent Vidal:
Designing Spacecraft Command Loops Using Two-Dimension Vehicle Routing. CPAIOR 2016: 303-318 - 2015
- [c27]Patrick Bechon, Magali Barbier, Charles Lesire, Guillaume Infantes
, Vincent Vidal:
Using hybrid planning for plan reparation. ECMR 2015: 1-6 - [c26]Alexandre Quemy, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Solving Large MultiZenoTravel Benchmarks with Divide-and-Evolve. LION 2015: 262-267 - 2014
- [c25]Patrick Bechon, Magali Barbier, Guillaume Infantes, Charles Lesire, Vincent Vidal:
HiPOP: Hierarchical Partial-Order Planning. STAIRS 2014: 51-60 - 2013
- [c24]Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Multi-objective AI Planning: Evaluating DaE YAHSP on a Tunable Benchmark. EMO 2013: 36-50 - [c23]Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches. EvoCOP 2013: 202-213 - [c22]Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Pareto-Based Multiobjective AI Planning. IJCAI 2013: 2321-2327 - [c21]Simon Vernhes, Guillaume Infantes, Vincent Vidal:
Problem Splitting Using Heuristic Search in Landmark Orderings. IJCAI 2013: 2401-2407 - [c20]Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning. LION 2013: 341-356 - [i4]Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Multi-Objective AI Planning: Comparing Aggregation and Pareto Approaches. CoRR abs/1305.1169 (2013) - [i3]Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning. CoRR abs/1305.2265 (2013) - 2012
- [c19]Simon Vernhes, Guillaume Infantes, Vincent Vidal:
The Landmark-based Meta Best-First Search Algorithm for Classical Planning. STAIRS 2012: 336-347 - [i2]Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Multi-Objective AI Planning: Evaluating DAE-YAHSP on a Tunable Benchmark. CoRR abs/1212.5276 (2012) - 2011
- [c18]Florent Teichteil-Königsbuch, Vincent Vidal, Guillaume Infantes:
Extending Classical Planning Heuristics to Probabilistic Planning with Dead-Ends. AAAI 2011: 1017-1022 - [c17]Caner Candan, Johann Dréo, Pierre Savéant, Vincent Vidal:
Parallel divide-and-evolve: experiments with OpenMP on a multicore machine. GECCO 2011: 1571-1578 - 2010
- [c16]Jacques Bibai, Pierre Savéant, Marc Schoenauer, Vincent Vidal:
An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning. ICAPS 2010: 18-25 - [c15]Jacques Bibai, Pierre Savéant, Marc Schoenauer, Vincent Vidal:
On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme. EvoCOP 2010: 23-34 - [c14]Jacques Bibai, Pierre Savéant, Marc Schoenauer, Vincent Vidal:
On the generality of parameter tuning in evolutionary planning. GECCO 2010: 241-248 - [c13]Vincent Vidal, Lucas Bordeaux, Youssef Hamadi:
Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning. SOCS 2010: 100-107
2000 – 2009
- 2009
- [j4]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Reasoning from last conflict(s) in constraint programming. Artif. Intell. 173(18): 1592-1614 (2009) - 2008
- [p1]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
- [j3]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Recording and Minimizing Nogoods from Restarts. J. Satisf. Boolean Model. Comput. 1(3-4): 147-167 (2007) - [c12]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Transposition Tables for Constraint Satisfaction. AAAI 2007: 243-248 - [c11]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance. CP 2007: 453-467 - [c10]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Nogood Recording from Restarts. IJCAI 2007: 131-136 - 2006
- [j2]Vincent Vidal, Hector Geffner:
Branching and pruning: An optimal temporal POCL planner based on constraint programming. Artif. Intell. 170(3): 298-335 (2006) - [c9]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Last Conflict Based Reasoning. ECAI 2006: 133-137 - [c8]Marc Schoenauer, Pierre Savéant, Vincent Vidal:
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning. EvoCOP 2006: 247-260 - [c7]Zied Loukil, Abdelmajid Ben Hamadou, Pierre Marquis, Vincent Vidal:
Les ressources et la planification temporelle. INFORSID 2006: 515-529 - [i1]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
- [c6]Vincent Vidal, Hector Geffner:
Solving Simple Planning Problems with More Inference and No Search. CP 2005: 682-696 - 2004
- [c5]Vincent Vidal, Hector Geffner:
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming. AAAI 2004: 570-577 - [c4]Vincent Vidal:
A Lookahead Strategy for Heuristic Search Planning. ICAPS 2004: 150-160 - 2003
- [c3]Vincent Vidal:
A lookahead strategy for solving large planning problems. IJCAI 2003: 1524-1525 - 2001
- [j1]Michel Cayrol, Pierre Régnier, Vincent Vidal:
Least commitment in Graphplan. Artif. Intell. 130(1): 85-118 (2001) - 2000
- [c2]Michel Cayrol, Pierre Régnier, Vincent Vidal:
New Results about LCGP, a Least Committed GraphPlan. AIPS 2000: 273-282
1990 – 1999
- 1999
- [c1]Vincent Vidal, Pierre Régnier:
Total Order Planning is More Efficient than we Thought. AAAI/IAAI 1999: 591-596
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-07 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
