Τμήμα Πληροφορικής / Department of Computer Science: Recent submissions
Now showing items 901-920 of 1952
-
Conference Object
Profit-aware server allocation for green internet services
(2010)A server farm is examined, where a number of servers are used to offer a service to impatient customers. Every completed request generates a certain amount of profit, running servers consume electricity for power and ...
-
Conference Object
The price of selfish routing
(2001)The problem of routing in congested communication networks was studied. A noncooperative network consisting of a set of m parallel links within a game theoretic framework was considered for analysis. A collection of n ...
-
Article
Designing context models for CARS incorporating partially observable context
(2015)Context modelling and context reasoning are widely used topics in Context-Aware Recommender Systems research. Based on our research, the development of context models in context-aware recommender systems is problematic in ...
-
Article
Efficient, strongly consistent implementations of shared memory
(1992)We present linearizable implementations for two distributed organizations of multiprocessor shared memory. For the full caching organization, where each process keeps a local copy of the whole memory, we present a linearizable ...
-
Article
Linearizable read/write objects
(1999)We study the cost of using message passing to implement linearizable read/write objects for shared-memory multiprocessors under various assumptions on the available timing information. We take as cost measures the worst-case ...
-
Conference Object
A randomized, O(log w)-depth 2-smoothing network
(2009)A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous propagation through the network. The maximum ...
-
Conference Object
The impact of randomization in smoothing networks
(2008)We revisit smoothing networks[3], which are made up of balancers and wires. Tokens arrive arbitrarily on w input wires and propagate asynchronously through the network
-
Article
A glimpse at Christos H. Papadimitriou
(2009)Christos H. Papadimitriou is one of the most influential and colorful researchers in Computer Science today. This glimpse is the outcome of a modest attempt of us to a biographical introduction to Christos, which we have ...
-
Article
The impact of randomization in smoothing networks
(2010)We revisit randomized smoothing networks (Herlihy and Tirthapura in J Parallel Distrib Comput 66(5):626-632, 2006), which are made up of balancers and wires. We assume that balancers are oriented independently and uniformly ...
-
Book
The impact of timing on linearizability in counting networks
(Max-Planck-Institut für Informatik, 1996)
-
Article
The price of selfish routing
(2007)We study the problem of routing traffic through a congested network. We focus on the simplest case of a network consisting of m parallel links. We assume a collection of n network users
-
Article
How many attackers can selfish defenders catch?
(2013)In a distributed system with attacks and defenses, both attackers and defenders are self-interested entities. We assume a reward-sharing scheme among interdependent defenders
-
Conference Object
How many attackers can selfish defenders catch?
(2008)In a distributed system with attacks and defenses, an economic investment in defense mechanisms aims at increasing the degree of system protection against the attacks. We study such investments in the selfish setting, where ...
-
Article
Cost sharing mechanisms for fair pricing of resource usage
(2008)We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand
-
Article
A cost mechanism for fair pricing of resource usage
(2005)We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand
-
Article
Trade-off results for connection management
(2003)A connection management protocol establishes and handles a connection between two hosts across a wide-area network to allow reliable message delivery. We continue the previous work of Kleinberg et al. (Proceedings of the ...
-
Article
Weighted boolean formula games
(2007)We introduce a new class of succinct games, called weighted boolean formula games. Here, each player has a set of boolean formulas he wants to get satisfied. The boolean formulas of all players involve a ground set of ...
-
Article
Weighted Boolean formula games
(2015)We introduce weighted boolean formula games (WBFG) as a new class of succinct games. Each player has a set of boolean formulas she wants to get satisfied
-
Article
Voronoi games on cycle graphs
(2008)In a Voronoi game, each of a finite number of players chooses a point in some metric space. The utility of a player is the total measure of all points that are closer to him than to any other player, where points equidistant ...
-
Conference Object
Impact of timing on linearizability in counting networks
(IEEE, 1997)Counting networks form a new class of distributed, low-contention data structures, made up of interconnected balancers and are suitable for solving a variety of multiprocessor synchronization problems that can be expressed ...