Sciweavers

4781 search results - page 142 / 957
» Online algorithms for network design
Sort
View
WWW
2008
ACM
16 years 7 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
Yunhong Zhou, Victor Naroditskiy
AINA
2003
IEEE
15 years 11 months ago
Design, Implementation and Performance Evaluation of IP-VPN
Network security has always been a significant issue, but a recognized priority today due to the popular of internet. The issue is not if security should be implemented on a netwo...
Jin-Cherng Lin, Ching-Tien Chang, Wei-Tao Chung
SODA
2001
ACM
115views Algorithms» more  SODA 2001»
15 years 8 months ago
Loss-bounded analysis for differentiated services
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
Alexander Kesselman, Yishay Mansour
ANOR
2010
130views more  ANOR 2010»
15 years 4 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
CORR
2002
Springer
92views Education» more  CORR 2002»
15 years 6 months ago
Source Routing and Scheduling in Packet Networks
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
Matthew Andrews, Antonio Fernández, Ashish ...