Sciweavers

3455 search results - page 210 / 691
» Generalized Game Trees
Sort
View
TON
2002
144views more  TON 2002»
15 years 6 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
COCOA
2008
Springer
15 years 8 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 8 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
TARK
2009
Springer
16 years 1 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow
ICWL
2009
Springer
16 years 1 months ago
Bridging the Gap: Adaptive Games and Student-Centered VLEs
The widely used e-learning technology is facing new challenges such as how to produce student-centered systems that can be adapted to the needs of each student. Those objectives sh...
Ángel del Blanco, Javier Torrente, Pablo Mo...