Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Vasco M. Manquinho"'
Publikováno v:
Proceedings of the VLDB Endowment. 13:2853-2856
Nowadays, many data analysts are domain experts, but they lack programming skills. As a result, many of them can provide examples of data transformations but are unable to produce the desired query. Hence, there is an increasing need for systems capa
Autor:
David Garlan, Pedro Orvalho, Changjian Zhang, Ryan Wagner, Vasco M. Manquinho, Eunsuk Kang, Ruben Martins
Publikováno v:
ESEC/SIGSOFT FSE
Alloy is a declarative modeling language based on a first-order relational logic. Its constraint-based analysis has enabled a wide range of applications in software engineering, including configuration synthesis, bug finding, test-case generation, an
Publikováno v:
AAAI
Current Maximum Satisfiability (MaxSAT) algorithms based on successive calls to a powerful Satisfiability (SAT) solver are now able to solve real-world instances in many application domains. Moreover, replacing the SAT solver with a Satisfiability Mo
Autor:
Vasco M. Manquinho, Claire Le Goues, Inês Lynce, Aidan Z. H. Yang, Ansong Ni, Ruben Martins, Daniel Ramos
Publikováno v:
ICSE (Companion Volume)
This paper provides provides a guide to the replication package of SOAR: A Synthesis Approach for Data Science API Refactoring. Our replication package provides a reliable way of reproducing results of the paper using a virtual machine. The replicati
Autor:
Inês Lynce, Claire Le Goues, Vasco M. Manquinho, Aidan Z. H. Yang, Ruben Martins, Daniel Ramos, Ansong Ni
Publikováno v:
ICSE
With the growth of the open-source data science community, both the number of data science libraries and the number of versions for the same library are increasing rapidly. To match the evolving APIs from those libraries, open-source organizations of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99a8e2490a7b38db6dd76e69166e286f
http://arxiv.org/abs/2102.06726
http://arxiv.org/abs/2102.06726
Autor:
Vasco M. Manquinho, Olivier Roussel
Publikováno v:
Frontiers in Artificial Intelligence and Applications
Pseudo-Boolean and cardinality constraints are a natural generalization of clauses. While a clause expresses that at least one literal must be true, a cardinality constraint expresses that at least n literals must be true and a pseudo-Boolean constra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5820a304f33edd163284401c65a974a
https://doi.org/10.3233/faia201012
https://doi.org/10.3233/faia201012
Publikováno v:
Journal of Heuristics. 25:339-375
With the blooming of cloud computing, the demand for data centers has been rising greatly in recent years. Their energy consumption and environmental impact has become much more significant due to the continuous growth of data center supply. It is po
Publikováno v:
SASB
Cellular processes are governed by complex molecular regulatory networks. To understand the dynamics emerging from these networks, a popular approach relies on a Boolean abstraction. These Boolean regulatory networks define qualitative models with di
Publikováno v:
Computers & Operations Research. 136:105471
The (environmental) selection procedure in Evolutionary Multiobjective Optimization Algorithms (EMOAs) can be interpreted as a subset selection problem, where the goal is to determine a subset of a given size that maximizes a quality indicator. The h
Publikováno v:
IJCAI
Constraint-based reasoning methods thrive in solving problem instances with a tight solution space. On the other hand, evolutionary algorithms are usually effective when it is not hard to satisfy the problem constraints. This dichotomy has been obser