In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division m...
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...