Buscar
Mostrando ítems 1-10 de 28
Ponencia
Witness-Bar Visibility Graphs
(Instituto de Matemáticas de la UNAM, 2013)
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted ...
Ponencia
Multiple Objective TSP based on ACO
(Universidad de Almería, 2003)
In this paper we present an Ant Colony Optimisation based algorithm to determine the Pareto set for the Multiple Objective Travelling Salesman Problem. Our results are then compared with the ones obtained with a genetic ...
Ponencia
Técnicas cuánticas para la evolución de grafos aleatorios
(Instituto de Matemáticas de la UNAM, 2015)
Con la idea de modelar el comportamiento de diversas redes sociales a lo largo del tiempo, mostramos algunos resultados preliminares sobre evolución de grafos aleatorias empleando técnicas inspiradas en la mecánica ...
Ponencia
Anchura de un convexo en la esfera.
(1997-01)
Se generaliza el concepto de anchura de un conjunto en el plano a la superficie de la esfera, dando condiciones necesarias y suficientes para que un conjunto convexo sobre la superficie de la esfera puede pasar a través ...
Ponencia
Algunas notas sobre mosaicos de Penrose
(Alberto Márquez, 2002)
Ponencia
MONACO - Multi-Objective Network Optimisation Based on an ACO
(Universidad de Sevilla, 2003)
The Ant Colony Optimisation Algorithm (ACO) supports the development of a system for a multi-objective network optimisation problem. The ACO system bases itself on an agent’s population and, in this case, uses a multi-level ...
Ponencia
Witness bar visibility
(2013)
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted ...
Ponencia
Diameter of a set on the cylinder
(Queen's University, 1997)
Ponencia
Separación y clasificación de puntos rojos y azules
(Universidad de Valladolid, 2007)
En este trabajo estudiamos el problema de determinar si dos conjuntos disjuntos de n puntos en el plano son separables mediante una estructura de 2-level tree, compuesta por una recta y dos semirrectas, y diseñamos ...
Ponencia
More results about spanners in the l1-metric
(Universidad de Sevilla, 2003)
In this work we study more questions about spanners in the l1-metric. Concretely, we will see that adding some Steiner points to a set of sites the metrically complete graph of the new set has a linear number of edges. ...