Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...