Browsing by Author "Álvarez Faura, M. del Carme"
Now showing items 1-20 of 33
-
A Characterization of universal stability for directed graphs in the adversarial queueing model
(2002-01)
External research report
Open AccessIn this paper we provide a characterization of universal stability for digraphs in the general case that the packets are not restricted to follow simple paths. Furthermore, we consider a variation of the Nearest To Go ... -
A Characterization of universal stability in the adversarial queuing model
(2003-10)
External research report
Open AccessWe study universal stability of directed and undirected graphs in the adversarial queueing model for static packet routing. In this setting, packets are injected in some edge and have to traverse a predefined path before ... -
A Compendium of problems complete for symmetric logarithmic space
(1996-06)
External research report
Open AccessWe provide a compendium of problems that are complete for symmetric logarithmic space. Complete problems are one method ofstudying this class for which programming is nonintuitive. A number ofthe problems in the list were ... -
Adversarial models for priority-based networks
(2003-06)
External research report
Open AccessWe propose several variations of the adversarial queueing model. The priority model takes into account the case in which the packets can have different priorities, assigned by the adversary at injection time. The ... -
Celebrity games
(2016-10-04)
Article
Open AccessWe introduce Celebrity games, a new model of network creation games. In this model players have weights (W being the sum of all the player's weights) and there is a critical distance ß as well as a link cost a. The cost ... -
Communication tree problems
(2001-03)
External research report
Open AccessIn this paper, we consider random communication requirements and several cost measures for a particular model of tree routing on a complete network. First we show that a random tree does not give any approximation. Then ... -
Continuous monitoring in the dynamic sensor field model
(2011-05)
External research report
Open AccessIn this work we consider the problem of continuously monitoring a collection of data sets produced by sensors placed on moving or static targets. We propose a modification of the static sensor field model (SSSF) [2] to ... -
Els Límits de la computació : indecidibilitat i NP-completesa
(Edicions UPC, 2001)
Book
Restricted access to the UPC academic communityAquest text presenta una introducció a les teories de la calculabilitat i la complexitat a l'abast d'un estudiant de primer cicle d'una enginyeria informàtica. A partir de la justificació de la necessitat d'un model formal ... -
Firefighting as a Game
(2014)
External research report
Open AccessThe Firefighter Problem was proposed in 1995 [16] as a deterministic discrete-time model for the spread (and containment) of a fire. Its applications reach from real fires to the spreading of deseases and the containment ... -
Firefighting as a game
(2014-12-10)
Article
Open AccessThe Firefighter Problem was proposed in 1995 [16] as a deterministic discrete-time model for the spread (and containment) of a fire. Its applications reach from real fires to the spreading of diseases and the containment ... -
Firefighting as a strategic game
(Taylor & Francis, 2016-03-31)
Article
Open AccessThe Firefighter Problem was proposed in 1995 as a deterministic discrete-time model for the spread and containment of a fire. The problem is defined on an undirected finite graph G = (V, E), where fire breaks out initially ... -
High level communication functionalities for wireless sensor networks
(2004-11)
External research report
Open AccessIn this work we propose a way to establish a reliable and efficient high level communication system in a randomly deployed network of sensors equipped with directional antennas. This high level communication system will ... -
Intervalizing colored graphs is NP-complete for caterpilars with hair length 2
(1998-02)
External research report
Open AccessThe problem of Intervalizing Colored Graphs has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-Complete ... -
Maximum congestion games on networks: How can we compute their equilibria?
(2007-09)
External research report
Open AccessWe study Network Maximum Congestion Games, a class of network games where players choose a path between two given nodes in order to minimize the congestion of the bottleneck (the most congested link) of their path. For ... -
Network creation games: structure vs anarchy
(2017-09-03)
External research report
Open AccessWe study Nash equilibria and the price of anarchy in the classical model of Network Creation Games introduced by Fabrikant et al. In this model every agent (node) buys links at a prefixed price a > 0 in order to get connected ... -
Network formation for asymmetric players and bilateral contracting
(2016-10-01)
Article
Open AccessWe study a network formation game where players wish to send traffic to other players. Players can be seen as nodes of an undirected graph whose edges are defined by contracts between the corresponding players. Each player ... -
On the existence of Nash equilibria in strategic search games
(2011)
Conference report
Open AccessWe consider a general multi-agent framework in which a set of n agents are roaming a network where m valuable and sharable goods (resources, services, information ....) are hidden in m different vertices of the network. ... -
On the proper intervalization of colored caterpillar trees
(2009)
Article
Restricted access - publisher's policyThis paper studies the computational complexity of the proper interval colored graph problem (picg), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a ... -
On the proper intervalization of colored caterpillar trees
(2009-11-01)
External research report
Open AccessThis paper studies the computational complexity of the Proper interval colored graph problem (picg), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a ... -
Parallel complexity of partially commutative monoids
(1989-01)
External research report
Open AccessWe consider the parallel complexity of some problems issued from Petri nets, partially commutative monoids and finite automata. we prove the following: (19 The membership problem for firing sequances on Petri Nets can be ...
