Sciweavers

2796 search results - page 235 / 560
» The coolest path problem
Sort
View
CIC
2006
102views Communications» more  CIC 2006»
15 years 8 months ago
On-line Algorithm for Server Selection of Video Streaming over P2P Networks
We consider a video streaming application over P2P networks and introduce the P2P on-line server selection problem. This task is related to the classic K-server problem, known fro...
Hao Wang, Andras Farago
COMCOM
2004
92views more  COMCOM 2004»
15 years 6 months ago
Genetic algorithms for multiple multicast on WDM ring network
The optimal multiple multicast problem (OMMP) on wavelength division multiplexing ring networks without wavelength conversion is considered in this paper. When the physical networ...
Der-Rong Din
INFOCOM
2012
IEEE
13 years 9 months ago
On exploiting flow allocation with rate adaptation for green networking
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
Jian Tang, Brendan Mumey, Yun Xing, Andy Johnson
CORR
2012
Springer
235views Education» more  CORR 2012»
14 years 2 months ago
An Incremental Sampling-based Algorithm for Stochastic Optimal Control
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
Vu Anh Huynh, Sertac Karaman, Emilio Frazzoli
COCOON
2009
Springer
16 years 1 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch