Sciweavers

7796 search results - page 365 / 1560
» On Generalized Schur Numbers
Sort
View
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
16 years 3 days ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
IPSN
2003
Springer
16 years 2 days ago
A Distributed Algorithm for Waking-up in Heterogeneous Sensor Networks
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
Akis Spyropoulos, Cauligi S. Raghavendra, Viktor K...
INFOCOM
2002
IEEE
15 years 11 months ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic
ISVLSI
2002
IEEE
109views VLSI» more  ISVLSI 2002»
15 years 11 months ago
A Network on Chip Architecture and Design Methodology
We propose a packet switched platform for single chip systems which scales well to an arbitrary number of processor like resources. The platform, which we call Network-on-Chip (NO...
Shashi Kumar, Axel Jantsch, Mikael Millberg, Johnn...
FUN
2010
Springer
269views Algorithms» more  FUN 2010»
15 years 11 months ago
The Feline Josephus Problem
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
Frank Ruskey, Aaron Williams