In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary timeinvariant function of the channel output samples is consider...
We treat the evaluation of a fixed-amplitude variable-phase integral of the form b a exp[ikG(x)]dx, where G (x) 0 and has moderate differentiability in the integration interval. ...
The debate on “openness” has tended to focus on standard setting, software copyrights, patent policy and collaborative innovation models – large issues that evoke heated deb...
Sacha Wunsch-Vincent, Taylor Reynolds, Andrew Wyck...
We consider the task of computing power productsQ 1ik gei i ("multi-exponentiation") where base elements g2, . . ., gk are fixed while g1 is variable between multi-expone...