Exploració per tema "Trees"

Ara es mostren els items 1-20 de 21

    • A biased random-key genetic algorithm for the capacitated minimum spanning tree problem 

      Ruiz Ruiz, Hector Efrain; Albareda Sambola, Maria; Fernández Aréizaga, Elena; Resende, Mauricio G. C. (2015-05)
      Article
      Accés obert
      This paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central processor and a set of remote terminals with specified demands for traffic that must flow between the central processor and terminals,the ...

    • A compositional analysis approach assessing the spatial distribution of trees in Guadalajara, Mexico 

      Cruz Sandoval, Marco Antonio; Ortego Martínez, María Isabel; Roca Bosch, Elisabet (Università di Cassino e del Lazio Meridionale, 2019)
      Text en actes de congrés
      Accés obert
      Urban green infrastructure such as parks, gardens and trees, provide several ecosystem services and benefits. Particularly trees provide a broad amount of services in urban areas, such as improving air quality, mitigating ...

    • Algorithms for sampling spanning trees uniformly at random 

      Costantini, Lucia (Universitat Politècnica de Catalunya, 2020-07)
      Projecte Final de Màster Oficial
      Accés obert
      Thesis on the analysis of various algorithms for sampling spanning trees of a graph uniformly at random.

    • Cinco escenas fílmicas. Cinco formas de habitar los espacios domésticos en torno a un árbol 

      Devesa Devesa, Ricardo (Cátedra Blanca Barcelona, 2012-04)
      Article
      Accés restringit per política de l'editorial

    • Diseño e implementación de algoritmos de unificación y matching para términos comprimidos. 

      Ramos Garrido, Lander (Universitat Politècnica de Catalunya, 2011-06-30)
      Projecte/Treball Final de Carrera
      Accés obert
      Las gramáticas incontextuales se pueden utilizar como herramienta para comprimir palabras o términos. Estas gramáticas pueden permitir en casos extremos comprimir hasta un factor exponencial. Sobre este tipo de compresiones ...

    • Elaboració d'un Pla Director d'arbrat viari al municipi de Vilassar de Mar (Maresme) 

      Soler Rifa, Laura (Universitat Politècnica de Catalunya, 2019-07-10)
      Treball Final de Grau
      Accés restringit per decisió de l'autor
      Vilassar de Mar is a township sited at the region of Maresme with a populace of 20.636 inhabitants (data of the year 2017 by IDESCAT) and with a surface of 4km2. The urban green areas in Vilassar occupy a 5% of the total ...

    • Embranchements 2017 

      Fernández Tolós, Mònica; Sáez Ríos, Marta (Universitat Politècnica de Catalunya, 2017-07-28)
      Treball Final de Grau
      Accés restringit per decisió de l'autor
      Aquest projecte tracta sobre el disseny conceptual i estructural, i l’execució d’una estructura de decoració d’arbres amb l’objectiu de participar a la segona edició del festival ‘Embranchements’ que es realitza a la ciutat ...

    • Finding smallest supertrees under minor containment 

      Nishimura, Naomi; Prabhakar, Ragde; Thilikos Touloupas, Dimitrios (1999-10)
      Report de recerca
      Accés obert
      The diversity of application areas relying on tree-structured data results in a wide interest in algorithms which determine differences or similarities among trees. One way of measuring the similarity between trees ...

    • First results of a non destructive LIDAR system for the characterisation of tree crops as a support for the optimisation of pesticide treatments 

      Rosell Polo, Joan Ramon; Val Manterola, Luís; Planas de Martí, Santiago; Gil Moya, Emilio; Solanelles Batlle, Francesc; Palacín Roca, Jordi; Camp Feria-Carot, Fernando; Sanz Cortiella, Ricardo; Llorens Calveras, Jordi; Ribes-Dasi, Manel; Masip Vilalta, Joan; Arnó Satorra, Jaume; Vallès, Josep Maria; Escolà Agustí, Alexandre; Massana, Pere (2005)
      Comunicació de congrés
      Accés obert

    • Generació procedural d'arbres 

      Sánchez Herranz, Guillem (Universitat Politècnica de Catalunya, 2022-07-11)
      Treball Final de Grau
      Accés obert
      Aquest projecte tracta de la creació d'una eina per a dissenyadors i desenvolupadors de videojocs la qual podran fer servir per generar i modificar models d’arbres en funció dels paràmetres ambientals per a poder tenir ...

    • Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees 

      Gálvez Carrillo, Maria Immaculada; Kock, Joachim; Tonks, Andrew (2014)
      Article
      Accés restringit per política de l'editorial
      We prove a Faà di Bruno formula for the Green function in the bialgebra of P-trees, for any polynomial endofunctor P. The formula appears as relative homotopy cardinality of an equivalence of groupoids.

    • Health & urban conditions : impact of urban conditions on health : assessing the effects of the built environment and urban trees on the UHI and pollution 

      Fall, Ché-Yacine (Universitat Politècnica de Catalunya, 2023-09-15)
      Projecte Final de Màster Oficial
      Accés obert
      Rising temperatures, heat wave frequency, and anthropogenic pollution pose significant challenges to urban dwellers’ health. This study aimed to assess the effects of urban conditions on health in three sites in Barcelona, ...

    • Location routing problems on trees 

      Aráoz Durand, Julián Arturo; Fernández Aréizaga, Elena; Rueda, Salvador (2019-04-30)
      Article
      Accés obert
      This paper addresses combined location/routing problems defined on trees, where not all vertices have to be necessarily visited. A mathematical programming formulation is presented, which has the integrality property. The ...

    • Marked graphs and the chromatic symmetric function 

      Aliste Prieto, José; Mier Vinué, Anna de; Orellana, Rosa; Zamora Ponce, José (2023-09-30)
      Article
      Accés obert
      The main result of this paper is the introduction of marked graphs and the marked graph polynomials ( -polynomial) associated with them. These polynomials can be defined via a deletion-contraction operation. These polynomials ...

    • On the maximum common embedded subtree problem for ordered trees 

      Valiente Feruglio, Gabriel Alejandro (2003-03)
      Report de recerca
      Accés obert
      The maximum common embedded subtree problem, which generalizes the subtree homeomorphism problem, is reduced for ordered trees to a variant of the longest common subsequence problem, called the longest common balanced ...

    • Quasiperfect domination in trees 

      Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2015-12-18)
      Article
      Accés obert
      A k–quasiperfect dominating set ( k=1k=1) of a graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k–quasiperfect dominating ...

    • Rapport de fin de semestre ATELIER GAIA - Embranchements - Groupe 1 

      Rodríguez Barber, Ignacio; Talavera Contreras, Núria (Universitat Politècnica de Catalunya, 2017-07)
      Treball Final de Grau
      Accés restringit per decisió de l'autor
      Le festival Embranchements 2017 qui a lieu au Parc de la Pépinière de la Ville de Nancy entre le 19 et le 25 juin est une célébration de l’arbre avec l’ambition de mettre en lumière sa valeur. En utili-sant une combinaison ...

    • Sistema de medida de biopotenciales para plantas y árboles con PSoC 

      Lopez Sanchez, Maria Josep (Universitat Politècnica de Catalunya, 2011-07-22)
      Treball Final de Grau
      Accés obert

    • Sobre la forma final d'alguns arbres 

      Navés Viñas, Francesc; Brufau Niubó, Roberto (2006-12)
      Article
      Accés obert

    • The Glauber dynamics for edge-colorings of trees 

      Delcourt, Michelle; Heinrich, Marc; Perarnau Llobet, Guillem (2020-09-26)
      Article
      Accés obert
      Let T be a tree on n vertices and with maximum degree ¿. We show that for k = ¿ + 1 the Glauber dynamics for k-edge-colourings of T mixes in polynomial time in n. The bound on the number of colours is best possible as the ...