Browsing by Title Facultad de Ciencias Físicas y Matemáticas
Now showing items 2196-2215 of 22118
-
(JOHN WILEY & SONS LTD, 2008-03)
-
(Universidad de Chile, 2022)El presente trabajo corresponde a una Tesis de Doctorado, elaborada en el Departamento de Ingeniería Matemática de la Universidad de Chile, para obtener el grado de Doctor en Ciencias de la Ingeniería, Mención en Modelamiento ...
-
(Universidad de Chile, 2021)Este trabajo corresponde a una Tesis Doctoral para la obtención del grado de Doctor en Ciencias de la Ingeniería, mención Modelación Matemática. El presente trabajo está inscrito en la vasta área del Análisis Variacional ...
-
(IEEE, 2017)Multimedia searches often return items that can becategorized into several “topics”, allowing users to disambiguateand explore answers more efficiently. In this paper we investigatemethods for clustering tags associated ...
-
(Elsevier, 2020)Two approaches have traditionally been identified for developing artificial intelligence systems supporting decision-making: Machine Learning, which applies general techniques based on statistical analysis and optimization ...
-
(Springer-Verlag, 2008)Stellar image matching allows to verify if a given pair of images belongs to the same stellar object/area, or knowing that they correspond to the same sky area, to verify if there are some changes between them due to ...
-
(John Wiley & Sons, 2013)Ship routing problems are a particular kind of routing problems where the vehicles to be routed are vessels or ships, usually in maritime environments. In contrast to land routing, ship routing has unique features, including ...
-
(ELSEVIER, 2006-09-15)We consider a non-interacting one-dimensional gas accelerated by a constant and uniform external field. The energy absorbed from the field is transferred via elastic collisions to a bath of scattering obstacles. At ...
-
(2003)The L2- and H1-approximate controllability and homogenization of a semilinear elliptic boundary-value problem is studied in this paper. The principal term of the state equation has rapidly oscillating coefficients and ...
-
(Texas State University, 2017)In this article, we study the approximate controllability and home-genization results of a semi-linear elliptic problem with Robin boundary condition in a periodically perforated domain. We prove the existence of minimal ...
-
(Amer Inst Mathematical Sciences, 2015)Loebl, Komlos and Sos conjectured that every n-vertex graph G with at least n/2 vertices of degree at least k contains each tree T of order k + 1 as a subgraph. We give a sketch of a proof of the approximate version of ...
-
(2009)A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent ...
-
(Springer, 2007)A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can reproduce any substring of T, thus it actually replaces ...
-
(Universidad de Chile, 2022)Las salas de operaciones son una de las partes más importantes de los hospitales, y la principal fuente de gasto e ingresos. Calendarizar pacientes, utilizando eficientemente los recursos de las salas de operaciones podría ...
-
(Springer, 2017)It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on t vertices, for fixed t. We propose an algorithm that, given a 3-colorable ...
-
(IEEE, 2017)We study the two-dimensional geometricknapsack problem (2DK) in which we are given a setofnaxis-aligned rectangular items, each one with anassociated profit, and an axis-aligned square knapsack. ...
-
(Institute of Electrical and Electronics Engineers Inc., 2020)
-
(Springer, 2018)Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors) of ...
-
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)Consider the Maximum Weight Independent Setproblem for rectangles: given a family ofweighted axis-parallel rectangles in the plane, find a maximum-weight subset of non-overlappingrectangles. The problem is notoriously hard ...
-
(ELSEVIER, 2010)In this paper we shall study a fractional integral equation in an arbitrary Banach space X. We used the analytic semigroups theory of linear operators and the fixed point method to establish the existence and uniqueness ...