Sciweavers

5138 search results - page 947 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
CORR
2004
Springer
103views Education» more  CORR 2004»
14 years 11 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
COR
2002
95views more  COR 2002»
14 years 11 months ago
Dynamic lot sizing and tool management in automated manufacturing systems
The overall aim of this study is to show that there is a critical interface between the lot sizing and tool management decisions, and these two problems cannot be viewed in isolat...
M. Selim Akturk, Siraceddin Onen
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
14 years 11 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
MST
2002
107views more  MST 2002»
14 years 11 months ago
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
14 years 11 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...