-
1
المصدر: Proceedings of the Genetic and Evolutionary Computation Conference Companion.
مصطلحات موضوعية: Operations research, Search methodologies, Planning and Scheduling
الوصول الحر: https://explore.openaire.euTest/
search /publication?articleId=doi_dedup___::91d06c86dd17705a91367067bdcf9cc7
https://doi.org/10.1145/3520304.3528994Test -
2
المؤلفون: Almeida, José, Lezama, Fernando, Soares, João, Vale, Zita, Canizes, Bruno
المساهمون: Repositório Científico do Instituto Politécnico do Porto
المصدر: Proceedings of the Genetic and Evolutionary Computation Conference Companion.
مصطلحات موضوعية: Search methodologies, Engineering, Energy resource management, evolutionary computation, risk analysis, Applied computing, optimization, Computing methodologies
وصف الملف: application/pdf
الوصول الحر: https://explore.openaire.euTest/
search /publication?articleId=doi_dedup___::9b31aed94b92cd6cd73348671d04f946
https://doi.org/10.1145/3520304.3535080Test -
3
مصطلحات موضوعية: machine learning, Theory of computation → Design and analysis of algorithms, heuristic search and optimization, probabilistic model building, estimation-of-distribution algorithms, Computing methodologies → Search methodologies
الوصول الحر: https://explore.openaire.euTest/
search /publication?articleId=doi_________::287a1c15e9fad55c19c46413b6a8eed1 -
4
المؤلفون: Audemard, Gilles, Lagniez, Jean-Marie, Miceli, Marie
مصطلحات موضوعية: EMaj-SAT, Software and its engineering → Software notations and tools, SSAT, Weighted Projected Model Counting, Max#SAT, Computing methodologies → Search methodologies
الوصول الحر: https://explore.openaire.euTest/
search /publication?articleId=doi_________::c1276b0779d9116dc027f90b226498f8 -
5
المؤلفون: Barbieri, Massimo, Manenti, Flavio
المصدر: Politecnico di Milano-IRIS
مصطلحات موضوعية: database search, patent search methodologies, ricerche brevettuali, patent literature, patents, ComputingMilieux_LEGALASPECTSOFCOMPUTING, Idrogeno, patent searches, brevetti, Hydrogen
الوصول الحر: https://explore.openaire.euTest/
search /publication?articleId=doi_dedup___::8a4a43ca11f5cefc4fd56033f3fa18da -
6
المؤلفون: Ahmadi, Saman, Tack, Guido, Harabor, Daniel, Kilby, Philip
مصطلحات موضوعية: FOS: Computer and information sciences, heuristic search, Artificial Intelligence (cs.AI), Theory of computation → Shortest paths, Computer Science - Artificial Intelligence, Bi-objective search, Computer Science - Data Structures and Algorithms, I.2.8, Data Structures and Algorithms (cs.DS), Computing methodologies → Search methodologies, shortest path problem
الوصول الحر: https://explore.openaire.euTest/
search /publication?articleId=doi_dedup___::090890060d3b24eb90c4a71a3756ed73
http://arxiv.org/abs/2105.11888Test -
7
المؤلفون: Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz
مصطلحات موضوعية: Theory of computation → Pseudorandomness and derandomization, Theory of computation → Computational geometry, Security and privacy → Pseudonymity, anonymity and untraceability, Mathematics of computing → Graph enumeration, Mathematics of computing → Paths and connectivity problems, Theory of computation → Algorithmic game theory, Mathematics of computing → Random graphs, Theory of computation → Parameterized complexity and exact algorithms, Computing methodologies → Search methodologies, Front Matter, Theory of computation → Semidefinite programming, Table of Contents, Theory of computation → Shortest paths, Theory of computation → Machine learning theory, Theory of computation → Sparsification and spanners, Computing methodologies → Feature selection, Mathematics of computing → Discrete mathematics, Mathematics of computing → Topology, Theory of computation → Problems, reductions and completeness, Mathematics of computing → Algebraic topology, Theory of computation → Online algorithms, Mathematics of computing → Graphs and surfaces, Theory of computation → Packing and covering problems, Theory of computation → Graph algorithms analysis, Theory of computation → Cell probe models and lower bounds, Theory of computation → Quantum computation theory, Mathematics of computing → Permutations and combinations, Mathematics of computing → Graph coloring, Computing methodologies → Concurrent computing methodologies, Theory of computation → Data compression, Mathematics of computing → Trees, Theory of computation → Network optimization, Theory of computation → Data structures design and analysis, Mathematics of computing → Graph algorithms, Theory of computation → Scheduling algorithms, Theory of computation → Approximation algorithms analysis, Theory of computation → Fixed parameter tractability, Theory of computation → Algorithmic mechanism design, Theory of computation → Dynamic programming, Theory of computation → Pattern matching, Theory of computation → Backtracking, Theory of computation → Rounding techniques, Theory of computation → Dynamic graph algorithms, Mathematics of computing → Approximation algorithms, Mathematics of computing → Distribution functions, Theory of computation → Models of computation, Theory of computation → Design and analysis of algorithms, Mathematics of computing → Probabilistic algorithms, Theory of computation → Random network models, Theory of computation → Shared memory algorithms, Theory of computation → Quantum complexity theory, Theory of computation → Network flows, Conference Organization, Mathematics of computing → Matroids and greedoids, Preface, Networks → Network algorithms, Theory of computation → Algorithm design techniques, Theory of computation → Computational complexity and cryptography
الوصول الحر: https://explore.openaire.euTest/
search /publication?articleId=doi_________::680fffb25a506337a0daa8b00debae2e -
8
المؤلفون: Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz
مصطلحات موضوعية: Theory of computation → Pseudorandomness and derandomization, Theory of computation → Computational geometry, Security and privacy → Pseudonymity, anonymity and untraceability, Mathematics of computing → Graph enumeration, Mathematics of computing → Paths and connectivity problems, Theory of computation → Algorithmic game theory, Mathematics of computing → Random graphs, Theory of computation → Parameterized complexity and exact algorithms, Computing methodologies → Search methodologies, Theory of computation → Semidefinite programming, Theory of computation → Shortest paths, Theory of computation → Machine learning theory, Theory of computation → Sparsification and spanners, Computing methodologies → Feature selection, Mathematics of computing → Discrete mathematics, Mathematics of computing → Topology, Theory of computation → Problems, reductions and completeness, Mathematics of computing → Algebraic topology, Theory of computation → Online algorithms, Mathematics of computing → Graphs and surfaces, Theory of computation → Packing and covering problems, Theory of computation → Graph algorithms analysis, Theory of computation → Cell probe models and lower bounds, Theory of computation → Quantum computation theory, Mathematics of computing → Permutations and combinations, Mathematics of computing → Graph coloring, Computing methodologies → Concurrent computing methodologies, Theory of computation → Data compression, Mathematics of computing → Trees, Theory of computation → Network optimization, Theory of computation → Data structures design and analysis, Data processing Computer science, Mathematics of computing → Graph algorithms, Theory of computation → Scheduling algorithms, Theory of computation → Approximation algorithms analysis, Theory of computation → Fixed parameter tractability, LIPIcs, Volume 204, ESA 2021, Complete Volume, Theory of computation → Algorithmic mechanism design, Theory of computation → Dynamic programming, Theory of computation → Pattern matching, Theory of computation → Backtracking, Theory of computation → Rounding techniques, Theory of computation → Dynamic graph algorithms, Mathematics of computing → Approximation algorithms, Mathematics of computing → Distribution functions, Theory of computation → Models of computation, Theory of computation → Design and analysis of algorithms, Mathematics of computing → Probabilistic algorithms, Theory of computation → Random network models, Theory of computation → Shared memory algorithms, Theory of computation → Quantum complexity theory, Theory of computation → Network flows, Mathematics of computing → Matroids and greedoids, ddc:004, Networks → Network algorithms, Theory of computation → Algorithm design techniques, Theory of computation → Computational complexity and cryptography
وصف الملف: application/pdf
الوصول الحر: https://explore.openaire.euTest/
search /publication?articleId=doi_dedup___::a473de808f7f82a1dee1c640d7ddabfd -
9
المؤلفون: Talbi, El-Ghazali
المساهمون: Optimisation de grande taille et calcul large échelle (BONUS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189 (CRIStAL), Ecole Centrale de Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Ecole Centrale de Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Université de Lille, Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189 (CRIStAL), Ecole Centrale de Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)
مصطلحات موضوعية: Optimization, Deep neural networks, Machine learning, CCS Concepts: • Computing methodologies → Search methodologies Additional Key Words and Phrases: Metaheuristics, Metaheuristics, Hyperparameter optimization, Network architecture search, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
الوصول الحر: https://explore.openaire.euTest/
search /publication?articleId=dedup_wf_001::742df587e4542f6f3c4f14d3210b74f9
https://hal.inria.fr/hal-02570804Test -
10
المؤلفون: Lezama, Fernando, Soares, João, Faia, R., Vale, Zita, Macedo, Leonardo H., Romero, Rubén
المساهمون: Repositório Científico do Instituto Politécnico do Porto
المصدر: Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAPمصطلحات موضوعية: Search methodologies, Engineering, Appliedcomputing, Computing methodologie
وصف الملف: application/pdf
الوصول الحر: https://explore.openaire.euTest/
search /publication?articleId=dedup_wf_001::64e865315286c9781abf6bfee8989dd3