Sciweavers

2796 search results - page 509 / 560
» The coolest path problem
Sort
View
COMCOM
2004
117views more  COMCOM 2004»
14 years 11 months ago
The case for interdomain dynamic QoS-based service negotiation in the internet
The evolution of the Internet towards a global infrastructure for real time voice and video applications involves providing stringent Quality of Service (QoS) levels. Although som...
Carlos Alberto Kamienski, Djamel Sadok
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
14 years 6 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner
CORR
2011
Springer
210views Education» more  CORR 2011»
14 years 6 months ago
Competitive and Deterministic Embeddings of Virtual Networks
Network virtualization is a paradigm that allows for flexible and efficient allocation of the resources among multiple virtual networks (VNets). In this paper we deal with the p...
Guy Even, Moti Medina, Gregor Schaffrath, Stefan S...
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 6 months ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain
JCO
2011
113views more  JCO 2011»
14 years 6 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...