Buscar
Mostrando ítems 1-10 de 331
Ponencia
Delay effects on the limit cycling behavior in an H-bridge resonant inverter with zero current switching control strategy
(2018)
In this paper, bifurcations of limit cycles in a H-bridge LC resonant inverter under a zero current switching control strategy with delay in the switching action are analyzed. Mathematical analysis and numerical simulations ...
Tesis Doctoral
Values for games with authorization structure
(2015-03-11)
Ponencia
Metaheuristic approaches for the minimum dilation triangulation problem
(2013)
We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the complexity status of the Minimum Dilation Triangulation problem for a general point set is unknown. ...
Ponencia
Monotone crossing number of complete graphs
(2013)
In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = 1/4 n-1/2/2 n−2/2 n−3/2. Generalizing the result by Ábrego et al. for 2-page book drawings, we prove this conjecture for ...
Artículo
in λ-sums of normed spaces
(Guy Hirsch, 1989)
Let E n , n=1,2,··. be a sequence of normed spaces and λ an AK-Köthe sequence space. The λ-sum of the spaces E n is defined by λ{E n }:={(x n ) n : x n is in E n and (|x n |) n ∈λ}. Starting from the topology in λ, λ{E n ...
Ponencia
Continuous surveillance of points by rotating floodlights
(2013)
Let P and F be sets of n ≥ 2 and m ≥ 2 points in the plane, respectively, so that P∪F is in general position. We study the problem of finding the minimum angle α ∈ [2π/m, 2π] such that one can install at each point of F a ...
Artículo
A Value for Games Restricted by Augmenting Systems
(Society for Industrial and Applied Mathematics, 2010)
This paper deals with cooperative games in which only certain coalitions are allowed to form. There have been previous models developed to confront the problem of nonfeasible coalitions. Games restricted by a communication ...
Ponencia
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
(2013)
In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combinatorial 4-PPT is stretchable to a geometric ...
Tesis Doctoral
Ponencia
Empty convex polytopes in random point sets
(2013)
Given a set P of points in Rd, a convex hole (alternatively, empty convex polytope) of P is a convex polytope with vertices in P, containing no points of P in its interior. Let R be a bounded convex region in Rd. We show ...