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...
In this paper, we consider a class of sensor networks where the data is not required in real-time by an observer; for example, a sensor network monitoring a scientific phenomenon ...
Sameer Tilak, Nael B. Abu-Ghazaleh, Wendi Rabiner ...
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...
In mobile environments transmitting information relevant to an event along with notification of the event has been proven to be an effective means of providing revenue enhancing s...
Amit Thawani, Srividya Gopalan, V. Sridhar, Krithi...
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...