Sciweavers

58 search results - page 11 / 12
» Improved competitive ratio for the matroid secretary problem
Sort
View
INFOCOM
2010
IEEE
13 years 3 months ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
13 years 11 months ago
Online View Maintenance Under a Response-Time Constraint
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
Kamesh Munagala, Jun Yang 0001, Hai Yu
AOR
2007
107views more  AOR 2007»
13 years 5 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
CORR
2011
Springer
164views Education» more  CORR 2011»
12 years 9 months ago
Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks
Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully e...
Dushyant Arora, Marcin Bienkowski, Anja Feldmann, ...
WINE
2007
Springer
193views Economy» more  WINE 2007»
13 years 11 months ago
Auctions with Revenue Guarantees for Sponsored Search
We consider the problem of designing auctions with worst case revenue guarantees for sponsored search. This problem differs from previous work because of ad dependent clickthroug...
Zoë Abrams, Arpita Ghosh