Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Adam Welc"'
Autor:
Adam Welc
Publikováno v:
ESEC/SIGSOFT FSE
Microservices architecture, which is increasingly being adopted by large technology companies, can accelerate development and deployment of backend code by partitioning a monolithic infrastructure into independent components. At the same time, micros
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3492aec8423f7eefad07534f08876d6
https://doi.org/10.1145/3468264.3473918
https://doi.org/10.1145/3468264.3473918
Publikováno v:
Biologics, Vol 4, Iss 1, Pp 17-29 (2024)
Background: Patients living with chronic obstructive pulmonary disease (COPD) are at risk for lower respiratory tract infections caused by respiratory syncytial virus (RSV). The first RSV vaccines were approved in 2023 for adults ages 60 years and ol
Externí odkaz:
https://doaj.org/article/bb09eba944df489daab6fb6883edb72f
Publikováno v:
IEEE Software. 34:26-29
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::594994a5fec1911c2ab515131a6980ee
https://doi.org/10.1109/ms.2017.89
https://doi.org/10.1109/ms.2017.89
Autor:
Laurence Tratt, Adam Welc
Publikováno v:
IEEE Software. 31:76-79
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87a01eb3bcc26e9aa87979333812a009
https://doi.org/10.1109/ms.2014.109
https://doi.org/10.1109/ms.2014.109
Publikováno v:
DLS
The R language, from the point of view of language design and implementation, is a unique combination of various programming language concepts. It has functional characteristics like lazy evaluation of arguments, but also allows expressions to have a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::806dc54f1a9fab7301f1ed907d9a7afd
https://doi.org/10.1145/2989225.2989236
https://doi.org/10.1145/2989225.2989236
Publikováno v:
DLS
Today's Internet is long past static web pages filled with HTML-formatted text sprinkled with an occasional image or animation. We have entered an era of Rich Internet Applications executed locally on Internet clients such as web browsers: games, phy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84c921441b4ee7346196054854d571fb
https://doi.org/10.1145/2480360.2384585
https://doi.org/10.1145/2480360.2384585
Autor:
Robert L. Bocchino, Adam Welc, Stephen T. Heumann, Vikram Adve, Tatiana Shpeisman, Sarita V. Adve, Nima Honarmand
Publikováno v:
POPL
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound search, remains an open question. We present a language together with a ty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::77a376f9b529b5d471114e8519e324f1
https://doi.org/10.1145/1925844.1926447
https://doi.org/10.1145/1925844.1926447
Publikováno v:
Concurrency and Computation: Practice and Experience. 18:1613-1656
This paper proposes two approaches to managing concurrency in Java using a guarded region abstraction. Both approaches use revocation of such regions—the ability to undo their effects automatically and transparently. These new techniques alleviate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18c42325784aa811a416d1a768bd3f0e
https://doi.org/10.1002/cpe.1008
https://doi.org/10.1002/cpe.1008
Publikováno v:
Science of Computer Programming. 57:164-186
A transaction defines a locus of computation that satisfies important concurrency and failure properties. These so-called ACID properties provide strong serialization guarantees that allow us to reason about concurrent and distributed programs in ter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d27517a10e226151eac70914ebfd2cf3
https://doi.org/10.1016/j.scico.2005.03.001
https://doi.org/10.1016/j.scico.2005.03.001
Publikováno v:
SNAKDD
Triangle listing, or identifying all the triangles in an undirected graph, is a very important graph problem that serves as a building block of many other graph algorithms. The compute-intensive nature of the problem, however, necessitates an efficie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d82b20da8bf0210524feacc0d3a37fc
https://doi.org/10.1145/2659480.2659494
https://doi.org/10.1145/2659480.2659494