11
TÍTULO: Graph Neural Networks for Mapping Variables Between Programs
AUTORES: Pedro Orvalho; Jelle Piepenbrock; Mikoláš Janota; Vasco Manquinho;
PUBLICAÇÃO: 2023, FONTE: 26th European Conference on Artificial Intelligence, ECAI 2023 in Frontiers in Artificial Intelligence and Applications, VOLUME: 372
INDEXADO EM: Scopus CrossRef
NO MEU: ORCID
12
TÍTULO: Integrated lot-sizing and scheduling: Mitigation of uncertainty in demand and processing time by machine learning
AUTORES: Mohammad Rohaninejad; Mikoláš Janota; Zdeněk Hanzálek;
PUBLICAÇÃO: 2023, FONTE: Engineering Applications of Artificial Intelligence, VOLUME: 118
INDEXADO EM: CrossRef: 10
NO MEU: ORCID
13
TÍTULO: Data-driven Single Machine Scheduling Minimizing Weighted Number of Tardy Jobs
AUTORES: Nikolai Antonov; Přemysl Šucha; Mikoláš Janota;
PUBLICAÇÃO: 2023, FONTE: Lecture Notes in Computer Science - Progress in Artificial Intelligence
INDEXADO EM: CrossRef
NO MEU: ORCID
14
TÍTULO: Boosting isomorphic model filtering with invariants  Full Text
AUTORES: Araujo, Joao ; Chow, Choiwah; Janota, Mikolas;
PUBLICAÇÃO: 2022, FONTE: CONSTRAINTS, VOLUME: 27, NÚMERO: 3
INDEXADO EM: WOS CrossRef
NO MEU: ORCID
15
TÍTULO: SAT-Based Leximax Optimisation Algorithms
AUTORES: Cabral, M; Janota, M; Manquinho, V;
PUBLICAÇÃO: 2022, FONTE: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022 in Leibniz International Proceedings in Informatics, LIPIcs, VOLUME: 236
INDEXADO EM: Scopus
16
TÍTULO: TestSelector: Automatic Test Suite Selection for Student Projects
AUTORES: Marques, Filipe; Morgado, António ; Santos, Jose Fragoso; Janota, Mikolas;
PUBLICAÇÃO: 2022, FONTE: 22nd International Conference on Runtime Verification (RV) held as part of the Computational Logic Autumn Summit (CLAS) in RUNTIME VERIFICATION (RV 2022), VOLUME: 13498
INDEXADO EM: Scopus WOS DBLP CrossRef Unpaywall
17
TÍTULO: Guiding an Automated Theorem Prover with Neural Rewriting
AUTORES: Jelle Piepenbrock; Tom Heskes; Mikoláš Janota; Josef Urban;
PUBLICAÇÃO: 2022, FONTE: Lecture Notes in Computer Science - Automated Reasoning
INDEXADO EM: CrossRef: 1
NO MEU: ORCID
18
TÍTULO: The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets
AUTORES: Mikolás Janota; Morgado, António ; José Fragoso Santos; Vasco M Manquinho;
PUBLICAÇÃO: 2021, FONTE: 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25-29, 2021., VOLUME: 210
INDEXADO EM: Scopus DBLP
19
TÍTULO: Graph Neural Networks for Scheduling of SMT Solvers
AUTORES: Hula, J; Mojzísek, D; Janota, M;
PUBLICAÇÃO: 2021, FONTE: 2021 IEEE 33RD INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2021)
INDEXADO EM: WOS CrossRef: 4
NO MEU: ORCID
20
TÍTULO: SAT-Based Encodings for Optimal Decision Trees with Explicit Paths
AUTORES: Janota, M; Morgado, António ;
PUBLICAÇÃO: 2020, FONTE: 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT) in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, SAT 2020, VOLUME: 12178
INDEXADO EM: Scopus WOS DBLP CrossRef: 3 Unpaywall
NO MEU: ORCID
Página 2 de 10. Total de resultados: 99.