#### Writes About:

#### Filter Results:

- Full text PDF available (92)

#### Publication Year

1999

2018

- This year (3)
- Last 5 years (45)
- Last 10 years (108)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nikhil Bansal, Avrim Blum, Shuchi Chawla
- Machine Learning
- 2002

We consider the following clustering problem: we have a complete graph on n vertices (items), where each edge (u, v) is labeled either + or âˆ’ depending on whether u and v have been deemed to beâ€¦ (More)

- Nikhil Bansal, Mor Harchol-Balter
- SIGMETRICS/Performance
- 2001

The Shortest-Remaining-Processing-Time (SRPT) scheduling policy has long been known to be optimal for minimizing mean response time (sojourn time). Despite this fact, SRPT scheduling is rarely usedâ€¦ (More)

- Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs
- J. ACM
- 2007

Speed scaling is a power management technique that involves dynamically changing the speed of a processor. We study policies for setting the speed of the processor for both of the goals of minimizingâ€¦ (More)

- Nikhil Bansal, Maxim Sviridenko
- STOC
- 2006

We consider the following problem: The Santa Claus has n presents that he wants to distribute among m kids. Each kid has an arbitrary value for each present. Let p<sub>ij</sub> be the value that kidâ€¦ (More)

- Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
- SODA
- 2009

This article initiates a theoretical investigation into online scheduling problems with speed scaling where the allowable speeds may be discrete, and the power function may be arbitrary, and developsâ€¦ (More)

- Nikhil Bansal, Zhen Liu
- INFOCOM
- 2003

Network throughput and packet delay are two important parameters in the design and the evaluation of routing protocols for ad-hoc networks. While mobility has been shown to increase the capacity of aâ€¦ (More)

- Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson
- STOC
- 2004

Given a metric space <i>G</i> on <i>n</i> nodes, with a start node <i>r</i> and deadlines <i>D(v)</i> for each vertex <i>v</i>, we consider the <i>Deadline-TSP</i> problem of finding a path startingâ€¦ (More)

- Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs
- 45th Annual IEEE Symposium on Foundations ofâ€¦
- 2004

We first consider online speed scaling algorithms to minimize the energy used subject to the constraint that every job finishes by its deadline. We assume that the power required to run at speed s isâ€¦ (More)

- Nikhil Bansal, Kirk Pruhs, Clifford Stein
- SODA
- 2007

In addition to the traditional goal of efficiently managing time and space, many computers now need to efficiently manage power usage. For example, Intel's SpeedStep and AMD's PowerNOW technologiesâ€¦ (More)

- Nikhil Bansal, JosÃ© R. Correa, Claire Mathieu, Maxim Sviridenko
- Math. Oper. Res.
- 2006

We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into the minimum numberâ€¦ (More)