Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 2023
- Sara Tari, Matthieu Basseur, Adrien Goëffon:
Expansion-based Hill-climbing. Inf. Sci. 649: 119635 (2023) - 2022
- Sara Tari, Matthieu Basseur, Adrien Goëffon:
Partial neighborhood local searches. Int. Trans. Oper. Res. 29(5): 2761-2788 (2022) - 2021
- Sara Tari, Matthieu Basseur, Adrien Goëffon:
On the use of (1, λ )-evolution strategy as efficient local search mechanism for discrete optimization: a behavioral analysis. Nat. Comput. 20(3): 345-361 (2021) - Gorgoumack Sambe, Khadim Dramé, Adrien Basse:
Towards a Framework to Scaffold Problem-solving Skills in Learning Computer Programming. CSEDU (1) 2021: 323-330 - 2020
- Adrien Basse, Baboucar Diatta, Chérif Bachir Deme, Ndeye Massata Ndiaye:
Ontology-Based Framework For Automatic Generation Of SQL Assessment. ICETC 2020: 152-156 - 2019
- Baboucar Diatta, Adrien Basse, Samuel Ouya:
Bilingual Ontology-Based Automatic Question Generation. EDUCON 2019: 679-684 - Baboucar Diatta, Adrien Basse, Samuel Ouya:
PasOnto: Ontology for Learning Pascal Programming Language. EDUCON 2019: 749-754 - Adrien Basse, Baboucar Diatta, Samuel Ouya:
Ontology-Based System for Automatic SQL Exercises Generation. IMCL 2019: 738-749 - Baboucar Diatta, Adrien Basse, Chérif Bachir Deme, Samuel Ouya:
Automatic Source Code Generation from Owl Pseudocode. IMCL 2019: 717-725 - Baboucar Diatta, Chérif Bachir Deme, Adrien Basse, Samuel Ouya:
Framework for Automatic VPN Access to Remotely Discovered Resources. IMCL 2019: 327-336 - 2018
- Sara Tari, Matthieu Basseur, Adrien Goëffon:
Worst Improvement Based Iterated Local Search. EvoCOP 2018: 50-66 - Baboucar Diatta, Adrien Basse, Ndeye Massata Ndiaye:
Framework and Ontology for Modeling and Querying Algorithms. ICL (2) 2018: 536-544 - Baboucar Diatta, Adrien Basse, Samuel Ouya:
Ontology-Based Database for Chemical Experiments: Design and Implementation. ICL (1) 2018: 389-397 - Baboucar Diatta, Adrien Basse, Massamba Seck, Samuel Ouya:
Chemical Assessment Framework and Ontology. IMCL 2018: 385-393 - 2017
- Sara Tari, Matthieu Basseur, Adrien Goëffon:
Sampled Walk and Binary Fitness Landscapes Exploration. Artificial Evolution 2017: 47-57 - 2016
- Matthieu Basseur, Bilel Derbel, Adrien Goëffon, Arnaud Liefooghe:
Experiments on Greedy and Local Search Heuristics for ddimensional Hypervolume Subset Selection. GECCO 2016: 541-548 - Sara Tari, Matthieu Basseur, Adrien Goëffon:
Toward the Design of Efficient Pivoting Rules for Local Search. GECCO (Companion) 2016: 55-56 - 2015
- Matthieu Basseur, Adrien Goëffon:
Climbing combinatorial fitness landscapes. Appl. Soft Comput. 30: 688-704 (2015) - Matthieu Basseur, Adrien Goëffon, Hugo Traverson:
Exploring Non-neutral Landscapes with Neutrality-Based Local Search. LION 2015: 165-169 - Pierre Desport, Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
Empirical Analysis of Operators for Permutation Based Problems. LION 2015: 137-150 - 2014
- Matthieu Basseur, Adrien Goëffon:
On the efficiency of worst improvement for climbing NK-landscapes. GECCO 2014: 413-420 - Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion, Vincent Vigneron:
On the Attainability of NK Landscapes Global Optima. SOCS 2014: 28-34 - 2013
- Matthieu Basseur, Adrien Goëffon:
Hill-climbing strategies on various landscapes: an empirical comparison. GECCO 2013: 479-486 - Matthieu Basseur, Adrien Goëffon, Arnaud Liefooghe, Sébastien Vérel:
On set-based local search for multiobjective combinatorial optimization. GECCO 2013: 471-478 - Matthieu Basseur, Adrien Goëffon:
Hill-Climbing Behavior on Quantized NK-Landscapes. LION 2013: 209-214 - 2012
- Adrien Basse, Fabien Gandon, Isabelle Mirbel, Moussa Lo:
Représentation compacte du contenu de sources RDF. EGC 2012: 551-552 - 2010
- Adrien Lardilleux:
Contribution des basses fréquences à l'alignement sous-phrastique multilingue : une approche différentielle. (The contribution of low frequencies to multilingual sub-sentential alignment: a differential approach). University of Caen Normandy, France, 2010
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-06-02 20:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint