Sciweavers

315 search results - page 40 / 63
» Eigenvalue bounds for independent sets
Sort
View
TOMACS
2002
101views more  TOMACS 2002»
13 years 9 months ago
Efficient simulation of a tandem Jackson network
In this paper we consider a two-node tandem Jackson network. Starting from a given state, we are interested in estimating the probability that the content of the second buffer exc...
Dirk P. Kroese, Victor F. Nicola
INFOCOM
2010
IEEE
13 years 8 months ago
Price of Anarchy in Non-Cooperative Load Balancing
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service disciplin...
Urtzi Ayesta, Olivier Brun, Balakrishna Prabhu
WASA
2010
Springer
288views Algorithms» more  WASA 2010»
13 years 8 months ago
Approaching the Optimal Schedule for Data Aggregation in Wireless Sensor Networks
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
Pei Wang, Yuan He, Liusheng Huang
TCS
2010
13 years 4 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 10 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák