Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
We assume the existence of a parameterized family of control variates that could be used in a regenerative steady-state simulation. We show how such controls can be generated in t...
Today’s Internet users and applications are placing increased demands on Internet service providers (ISPs) to deliver fine-grained, flexible route control. To assist network o...
Patrick Verkaik, Dan Pei, Tom Scholl, Aman Shaikh,...
This work on cognitive radio access ventures beyond the more traditional “listen-before-talk” paradigm that underlies many cognitive radio access proposals. We exploit the bi-...
—We venture beyond the “listen-before-talk” strategy that is common in many traditional cognitive radio access schemes. We exploit the bi-directional nature of most primary c...