Sciweavers

545 search results - page 68 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 6 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 8 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
ACG
2006
Springer
15 years 10 months ago
RSPSA: Enhanced Parameter Optimization in Games
Most game programs have a large number of parameters that are crucial for their performance. Tuning these parameters by hand is rather difficult. Therefore automatic optimization a...
Levente Kocsis, Csaba Szepesvári, Mark H. M...
TON
2008
98views more  TON 2008»
15 years 3 months ago
A unified framework for multipath routing for unicast and multicast traffic
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 4 months ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos