Exploració per autor "Pelayo Melero, Ignacio Manuel"
Ara es mostren els items 6-25 de 67
-
Confección y gestión automática de exámenes tipo test
(Universidad de Cádiz, 2016)
Comunicació de congrés
Accés restringit per política de l'editorialEl presente trabajo describe la implementación de una aplicación informática como recurso docente, diseñada como plataforma para la elaboración, utilización y corrección de controles formativos y exámenes de evaluación. ... -
Creació de qüestionaris des de l'entorn moodle per a assignatures de matemàtiques i estadística corresponents a primers cursos de titulacións d'enginyeria
(Universitat Politècnica de Catalunya. Institut de Ciències de l'Educació, 2010-02-11)
Comunicació de congrés / Text en actes de congrés
Accés obertLa finalitat del projecte ha estat el disseny i la implementació d’un banc de 1345 preguntes, que permeten generar col•leccions de qüestionaris, utilitzant les prestacions que ofereix l’entorn Moodle. L’àmbit d’aplicació ... -
Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs
(2017-10-16)
Report de recerca
Accés obertLimited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ... -
Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs
(2018-04-20)
Article
Accés obertLimited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ... -
Extremal graph theory for metric dimension and diameter
(2010)
Article
Accés obert -
Feedforwarding : Plan, desarrollo y evaluación de un caso mediante el uso de campus virtual
(2016)
Capítol de llibre
Accés obertLa población de estudiantes puede ver los espacios de evaluación más como calificadores/clasificadores que como formativos; en numerosos contextos no se trata exclusivamente de una perspectiva, de “su” perspectiva personal, ... -
General bounds on limited broadcast domination
(2016-09-19)
Report de recerca
Accés obertLimited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ... -
General bounds on limited broadcast domination
(Chapman & Hall/CRC, 2018-10-26)
Article
Accés obertDominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and ... -
Generalizing the krein-milman property in graph convexity spaces: a short survey
(2006)
Comunicació de congrés
Accés restringit per política de l'editorial -
Global location-domination in graphs
(2013-12-03)
Report de recerca
Accés obertA dominating set S of a graph G is called locating-dominating, LD-setfor short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ... -
LD-graphs and global location-domination in bipartite graphs
(2014)
Text en actes de congrés
Accés obertA dominating setS of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ... -
LD-graphs and global location-domination in bipartite graphs
(2014-09-02)
Article
Accés restringit per política de l'editorialA dominating set S of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S . Locating-dominating sets of minimum ... -
Limited broadcast domination: upper bounds and complexity
(2017-07-07)
Capítol de llibre
Accés restringit per política de l'editorialEn este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ... -
Locating domination in bipartite graphs and their complements
(2018-01-01)
Article
Accés obertA set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ... -
Locating domination in bipartite graphs and their complements
(2017-11-03)
Report de recerca
Accés obertA set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ... -
Locating domination in bipartites graphs and their complements
(2017-07-07)
Capítol de llibre
Accés restringit per política de l'editorialEn este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ... -
Locating domination in graphs and their complements
(Universidad de Sevilla, 2013-10-16)
Capítol de llibre
Accés obertA dominating set S of a graph G is called locating-dominating , LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S . Locating-dominating sets ... -
Locating-dominating codes: Bounds and extremal cardinalities
(2013-09-01)
Article
Accés restringit per política de l'editorialIn this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses ... -
Locating-dominating partitions in graphs
(2016)
Text en actes de congrés
Accés obertLet G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . ... -
Majority multiplicative ordered weighting geometric operators and their use in the aggregation of multiplicative preference relations
(Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2005)
Article
Accés obertIn this paper, we introduced the majority multiplicative ordered weighted geometric (MM-OWG) operator and its properties. This is a general type of the aggregate dependent weights which we have applied in geometric ...
