Zobrazeno 1 - 10
of 401
pro vyhledávání: '"Casas, Pedro"'
Autor:
Shetty, Manish, Chen, Yinfang, Somashekar, Gagan, Ma, Minghua, Simmhan, Yogesh, Zhang, Xuchao, Mace, Jonathan, Vandevoorde, Dax, Las-Casas, Pedro, Gupta, Shachee Mishra, Nath, Suman, Bansal, Chetan, Rajmohan, Saravan
The rapid growth in the use of Large Language Models (LLMs) and AI Agents as part of software development and deployment is revolutionizing the information technology landscape. While code generation receives significant attention, a higher-impact ap
Externí odkaz:
http://arxiv.org/abs/2407.12165
Autor:
Roy, Devjeet, Zhang, Xuchao, Bhave, Rashi, Bansal, Chetan, Las-Casas, Pedro, Fonseca, Rodrigo, Rajmohan, Saravan
The growing complexity of cloud based software systems has resulted in incident management becoming an integral part of the software development lifecycle. Root cause analysis (RCA), a critical part of the incident management process, is a demanding
Externí odkaz:
http://arxiv.org/abs/2403.04123
In this paper we introduce a new algorithm for the \emph{$k$-Shortest Simple Paths} (\kspp{k}) problem with an asymptotic running time matching the state of the art from the literature. It is based on a black-box algorithm due to \citet{Roditty12} th
Externí odkaz:
http://arxiv.org/abs/2309.10377
Autor:
Zhang, Dylan, Zhang, Xuchao, Bansal, Chetan, Las-Casas, Pedro, Fonseca, Rodrigo, Rajmohan, Saravan
Major cloud providers have employed advanced AI-based solutions like large language models to aid humans in identifying the root causes of cloud incidents. Despite the growing prevalence of AI-driven assistants in the root cause analysis process, the
Externí odkaz:
http://arxiv.org/abs/2309.05833
Publikováno v:
European Journal of Operational Research, Volume 318, Issue 1, 1 October 2024, Pages 19-30
The landscape of applications and subroutines relying on shortest path computations continues to grow steadily. This growth is driven by the undeniable success of shortest path algorithms in theory and practice. It also introduces new challenges as t
Externí odkaz:
http://arxiv.org/abs/2307.10332
The Multiobjective Minimum Spanning Tree (MO-MST) problem is a variant of the Minimum Spanning Tree problem, in which the costs associated with every edge of the input graph are vectors. In this paper, we design a new dynamic programming MO-MST algor
Externí odkaz:
http://arxiv.org/abs/2306.16203
We propose a new sampling strategy, called smart active sapling, for quality inspections outside the production line. Based on the principles of active learning a machine learning model decides which samples are sent to quality inspection. On the one
Externí odkaz:
http://arxiv.org/abs/2209.11464
Publikováno v:
In Computers and Operations Research January 2025 173
Autor:
GARCÍA CASAS, PEDRO1 pedro.garciac@um.es
Publikováno v:
Carthaginensia. jul-dic2024, Vol. 40 Issue 78, p617-630. 14p.