Sciweavers

2566 search results - page 59 / 514
» The Online Median Problem
Sort
View
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
14 years 11 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
HCI
2007
14 years 5 days ago
Towards Building a Math Discourse Community: Investigating Collaborative Information Behavior
We reported a study that analyzes collaborative information behavior of small groups in an online math discourse community. Taking group as the unit of analysis, we analyzed the so...
Nan Zhou, Gerry Stahl
INFOCOM
2010
IEEE
13 years 9 months ago
Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow
—The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems where the ...
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
RANDOM
1998
Springer
14 years 3 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
NIPS
2003
14 years 3 days ago
An MDP-Based Approach to Online Mechanism Design
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...
David C. Parkes, Satinder P. Singh