#### Filter Results:

- Full text PDF available (57)

#### Publication Year

2003

2018

- This year (10)
- Last 5 years (45)
- Last 10 years (110)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Robert D. Kleinberg
- IEEE INFOCOM 2007 - 26th IEEE Internationalâ€¦
- 2007

We propose a scalable and reliable point-to-point routing algorithm for ad hoc wireless networks and sensor-nets. Our algorithm assigns to each node of the network a virtual coordinate in theâ€¦ (More)

Algorithms for learning to rank Web documents usually assume a document's relevance is independent of other documents. This leads to learned ranking functions that produce rankings with redundantâ€¦ (More)

- Robert D. Kleinberg
- NIPS
- 2004

In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. While nearly tightâ€¦ (More)

- Robert D. Kleinberg, Aleksandrs Slivkins, Eli Upfal
- STOC
- 2008

In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of $n$ trials so as to maximize the total payoff of the chosen strategies. While the performance ofâ€¦ (More)

- Baruch Awerbuch, Robert D. Kleinberg
- STOC
- 2004

Minimal delay routing is a fundamental task in networks. Since delays depend on the (potentially unpredictable) traffic distribution, online delay optimization can be quite challenging. Whileâ€¦ (More)

We study a partial-information online-learning problem where actions are restricted to noisy comparisons between pairs of strategies (also known as bandits). In contrast to conventional approachesâ€¦ (More)

We study a generalization of the classical secretary problem which we call the "matroid secretary problem". In this problem, the elements of a matroid are presented to an online algorithm in randomâ€¦ (More)

- Robert SoulÃ©, Shrutarshi Basu, +4 authors Nate Foster
- CoNEXT
- 2014

This paper presents Merlin, a new framework for managing resources in software-defined networks. With Merlin, administrators express high-level policies using programs in a declarative language. Theâ€¦ (More)

We consider the revenue-maximization problem for a seller with an unlimited supply of identical goods, interacting sequentially with a population of n buyers through an on-line posted-price auctionâ€¦ (More)

Algorithmic pricing is the computational problem that sellers (e.g.,in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a known demand.â€¦ (More)