Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Rosiane de Freitas Rodrigues"'
Autor:
Mauro Amazonas, Thais Castro, Bruno Gadelha, Rosiane de Freitas Rodrigues, Katia Vega, Hugo Fuks, Victor Vasconcelos
Publikováno v:
Human-Computer Interaction. Perspectives on Design ISBN: 9783030226459
HCI (1)
HCI (1)
As an audience for great live performances, people usually act as a passive spectator or interacting poorly with the performance themselves. Typically, the audience feels the need for higher engagement in these events, what happens spontaneously in s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7243d65838f26562b2f44c8e24ee36f
https://doi.org/10.1007/978-3-030-22646-6_26
https://doi.org/10.1007/978-3-030-22646-6_26
Autor:
Rosiane de Freitas Rodrigues, Pericles de Oliveira, Altigran Soares da Silva, Edleno Silva de Moura
Publikováno v:
ICDE
Several systems for processing keyword queries over relational databases rely on the generation and evaluation of Candidate Networks (CNs), i.e., networks of joined relations that when processed as SQL queries, provide a relevant answer to the input
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3edc5938e820b2ae81a302d29b8219f3
https://doi.org/10.1109/icde.2018.00146
https://doi.org/10.1109/icde.2018.00146
Publikováno v:
Discrete Applied Mathematics. 164:313-319
We consider a multi-purpose identical parallel machine scheduling problem, in which jobs should be executed on some machine belonging to a given subset of the set of machines. The problem is PMPM|r"j;p"j=1|@?w"jU"j, where there are n independent unit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfcf36cd619ebf5b6aac5c61ea2bf957
https://doi.org/10.1016/j.dam.2011.11.033
https://doi.org/10.1016/j.dam.2011.11.033
Publikováno v:
Mathematical Programming Computation. 2:259-290
This paper presents an exact algorithm for the identical parallel machine scheduling problem over a formulation where each variable is indexed by a pair of jobs and a completion time. We show that such a formulation can be handled, in spite of its hu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::729b142d914d665c10fb42a39e36ea23
https://doi.org/10.1007/s12532-010-0019-z
https://doi.org/10.1007/s12532-010-0019-z
Publikováno v:
Annals of Operations Research. 169:81-91
Consider a set of n unit time jobs, each one having a release date, a due date, both nonnegative integers, and a weight, a positive real number. Given a set of m parallel machines, we describe an algorithm for finding schedules with minimum weighted
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c3d81fff52c38b549a1adf049cdb52d
https://doi.org/10.1007/s10479-008-0479-y
https://doi.org/10.1007/s10479-008-0479-y
Publikováno v:
Anais do XXVIII Concurso de Teses e Dissertações (CTD 2015).
O problema de alocacao de canais e abordado, onde, dado uma rede movel sem fio com antenas de transmissao distribuidas na regiao de interesse e dada uma ou mais faixa de frequencia limitada discretizada em canais de transmissao, consiste em promover
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63e87aa8e391b0daa0c9589147b803c8
https://doi.org/10.5753/ctd.2015.10007
https://doi.org/10.5753/ctd.2015.10007
Autor:
Rosiane de Freitas Rodrigues, Diego Rodrigues, Altigran Soares da Silva, Eulanda Miranda dos Santos
Publikováno v:
IJCNN
The schema matching problem consists of finding semantic correspondences between elements (e.g., attributes) of two database schemas. Typically, methods to solve this problem first use pair-wise functions called matchers to generate similarity scores
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a923a58b1b8452c3ff58694bfe362762
https://doi.org/10.1109/ijcnn.2015.7280630
https://doi.org/10.1109/ijcnn.2015.7280630
Publikováno v:
ICTAI
This paper presents a framework to instantiate software technologies selection approaches by using search techniques. The software technologies selection problem (STSP) is modeled as a Combinatorial Optimization problem aiming attending different rea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a622c7a5f2aae3d647f7bbbb33e72703
https://doi.org/10.1109/ictai.2014.148
https://doi.org/10.1109/ictai.2014.148
Publikováno v:
Advances in Artificial Intelligence-SBIA 2012 ISBN: 9783642344589
SBIA
SBIA
The combination of testing techniques is considered an effective strategy to evaluate the quality of a software product. However, the selection of which techniques to combine in a software project has been an interesting challenge in the software eng
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58ed14539e3dfef8e3f809ca1ee1a85f
https://doi.org/10.1007/978-3-642-34459-6_23
https://doi.org/10.1007/978-3-642-34459-6_23
Publikováno v:
ICST Workshops
The combination of testing techniques is considered an effective strategy to evaluate a software product. However, the selection of which techniques to combine in a software project has been an interesting challenge in the Software Engineering field.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64fae17c477facc6a4352dc333d282ac
https://doi.org/10.1109/icstw.2011.33
https://doi.org/10.1109/icstw.2011.33