default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStéphane Le Ménec
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Stéphane Le Ménec
:
Swarm Guidance Based on Mean Field Game Concepts. IGTR 26(2): 2440008:1-2440008:18 (2024)- 2021
- [c5]Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, Stéphane Le Ménec:
An Interval Constraint Programming Approach for Quasi Capture Tube Validation. CP 2021: 18:1-18:17
2010 – 2019
- 2018
- [j8]Cédric Leboucher, Hyo-Sang Shin, Rachid Chelouah, Stéphane Le Ménec, Patrick Siarry, Mathias Formoso, Antonios Tsourdos, Alexandre Kotenkoff:
An Enhanced Particle Swarm Optimization Method Integrated With Evolutionary Game Theory. IEEE Trans. Games 10(2): 221-230 (2018) - 2017
- [j7]Sergey S. Kumkov, Stéphane Le Ménec, Valerii S. Patsko:
Zero-Sum Pursuit-Evasion Differential Games with Many Objects: Survey of Publications. Dyn. Games Appl. 7(4): 609-633 (2017) - [j6]Sergey S. Kumkov, Stéphane Le Ménec, Valerii S. Patsko:
Erratum to: Zero-Sum Pursuit-Evasion Differential Games with Many Objects: Survey of Publications. Dyn. Games Appl. 7(4): 634 (2017) - 2016
- [j5]Cédric Leboucher, Hyo-Sang Shin, Patrick Siarry, Stéphane Le Ménec, Rachid Chelouah, Antonios Tsourdos:
Convergence proof of an enhanced Particle Swarm Optimisation method integrated with Evolutionary Game Theory. Inf. Sci. 346-347: 389-411 (2016) - 2014
- [j4]Sergey S. Kumkov, Valery S. Patsko, Stéphane Le Ménec:
Two weak pursuers in a game against a single evader. Autom. Remote. Control. 75(10): 1770-1789 (2014) - [j3]Sergey S. Kumkov, Stéphane Le Ménec, Valery S. Patsko:
Level Sets of the Value Function in Differential Games with Two Pursuers and One Evader. Interval Analysis Interpretation. Math. Comput. Sci. 8(3-4): 443-454 (2014) - [c4]Cédric Leboucher, Patrick Siarry, Stéphane Le Ménec, Hyo-Sang Shin, Rachid Chelouah, Antonios Tsourdos:
An Enhanced Particle Swarm Optimisation Algorithm Combined with Neural Networks to Decrease Computational Time. ICSIBO 2014: 139-156 - [c3]Luc Jaulin, Daniel Lopez, Vincent Le Doze, Stéphane Le Ménec, Jordan Ninin, Gilles Chabert, Mohamed Saad Ibn Seddik, Alexandru Stancu:
Computing Capture Tubes. SCAN 2014: 209-224 - 2012
- [j2]Sergey Ganebny, Sergey S. Kumkov, Stéphane Le Ménec, Valerii S. Patsko:
Model Problem in a Line with Two Pursuers and One Evader. Dyn. Games Appl. 2(2): 228-257 (2012) - [j1]Cédric Leboucher, Rachid Chelouah, Patrick Siarry, Stéphane Le Ménec:
A Swarm Intelligence Method Combined to Evolutionary Game Theory Applied to the Resources Allocation Problem. Int. J. Swarm Intell. Res. 3(2): 20-38 (2012)
2000 – 2009
- 2009
- [c2]Stéphane Le Ménec:
Cooperative mid course guidance law based on attainability constrains. ECC 2009: 127-131 - 2003
- [c1]Jean-Loup Farges, Patrick Fabiani, Stéphane Le Ménec:
Blending of missile control modes with neural networks. NNSP 2003: 141-150
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 2025-01-09 13:02 CET 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:
