R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
Compositional question answering begins by mapping questions to logical forms, but training a semantic parser to perform this mapping typically requires the costly annotation of t...
Abstract—This paper investigates pricing of Internet connectivity services in the context of a monopoly ISP selling broadband access to consumers. We first study the optimal com...
Prashanth Hande, Mung Chiang, A. Robert Calderbank...
In light of the increased awareness of global energy consumption, questions are also being asked about the contribution of computing equipment. Though studies have documented the ...