Остановите войну!
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
no 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 23 matches
- 2012
- Wahabou Abdou, Christelle Bloch, Damien Charlet, François Spies:
Multi-Pareto-Ranking Evolutionary Algorithm. EvoCOP 2012: 194-205 - Florian Allerding, Marc Premm, Pradyumn Kumar Shukla, Hartmut Schmeck:
Electrical Load Management in Smart Homes Using Evolutionary Algorithms. EvoCOP 2012: 99-110 - Thais Ávila, Angel Corberán, Isaac Plana, José M. Sanchis:
An ILS-Based Metaheuristic for the Stacker Crane Problem. EvoCOP 2012: 25-36 - Francisco Chicano, Enrique Alba:
Exact Computation of the Fitness-Distance Correlation for Pseudoboolean Functions with One Global Optimum. EvoCOP 2012: 111-123 - Mathieu Chouchane, Sébastien Paris, François Le Gland, Mustapha Ouladsine:
Splitting Method for Spatio-temporal Sensors Deployment in Underwater Systems. EvoCOP 2012: 243-254 - Julián Domínguez, Enrique Alba:
A Methodology for Comparing the Execution Time of Metaheuristics Running on Different Hardware. EvoCOP 2012: 1-12 - Jérémie Dubois-Lacoste, Manuel López-Ibáñez, Thomas Stützle:
Pareto Local Search Algorithms for Anytime Bi-objective Optimization. EvoCOP 2012: 206-217 - Adnan Fakeih, Ahmed Kattan:
Recurrent Genetic Algorithms: Sustaining Evolvability. EvoCOP 2012: 230-242 - Abel García-Nájera:
The Vehicle Routing Problem with Backhauls: A Multi-objective Evolutionary Approach. EvoCOP 2012: 255-266 - Mario Garza-Fabre, Eduardo Rodriguez-Tello, Gregorio Toscano Pulido:
Multiobjectivizing the HP Model for Protein Structure Prediction. EvoCOP 2012: 182-193 - Marco Gavanelli, Maddalena Nonato, Andrea Peano, Stefano Alvisi, Marco Franchini:
Genetic Algorithms for Scheduling Devices Operation in a Water Distribution System in Response to Contamination Events. EvoCOP 2012: 124-135 - Jun He, Feidun He, Hongbin Dong:
Pure Strategy or Mixed Strategy? - An Initial Comparison of Their Asymptotic Convergence Rate and Asymptotic Hitting Time. EvoCOP 2012: 218-229 - Penny L. Holborn, Jonathan M. Thompson, Rhyd Lewis:
Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows. EvoCOP 2012: 63-74 - Jaber Jemai, Manel Zekri, Khaled Mellouli:
An NSGA-II Algorithm for the Green Vehicle Routing Problem. EvoCOP 2012: 37-48 - Jirí Kubalík:
Hyper-Heuristic Based on Iterated Local Search Driven by Evolutionary Algorithm. EvoCOP 2012: 148-159 - Samir Loudni:
Intensification/Diversification-Driven ILS for a Graph Coloring Problem. EvoCOP 2012: 160-171 - Noura Al Moubayed, Andrei Petrovski, John A. W. McCall:
D 2 MOPSO: Multi-Objective Particle Swarm Optimizer Based on Decomposition and Dominance. EvoCOP 2012: 75-86 - Gabriela Ochoa, Matthew R. Hyde, Timothy Curtois, José Antonio Vázquez Rodríguez, James D. Walker, Michel Gendreau, Graham Kendall, Barry McCollum, Andrew J. Parkes, Sanja Petrovic, Edmund K. Burke:
HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search. EvoCOP 2012: 136-147 - Rudinei Martins de Oliveira, Geraldo R. Mauri, Luiz Antonio Nogueira Lorena:
Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem. EvoCOP 2012: 49-62 - Mohsen Rahmani, Rubén A. Romero, Marcos J. Rider, Miguel Paredes:
Domain Reduction Using GRASP Construction Phase for Transmission Expansion Planning Problem. EvoCOP 2012: 87-98 - Francisco J. Rodríguez, Christian Blum, Manuel Lozano, Carlos García-Martínez:
Iterated Greedy Algorithms for the Maximal Covering Location Problem. EvoCOP 2012: 172-181 - Martin Schwengerer, Sandro Pirkwieser, Günther R. Raidl:
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem. EvoCOP 2012: 13-24 - Jin-Kao Hao, Martin Middendorf:
Evolutionary Computation in Combinatorial Optimization - 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings. Lecture Notes in Computer Science 7245, Springer 2012, ISBN 978-3-642-29123-4 [contents]
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-04-25 15:58 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