We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
An outstanding security problem in mobile agent systems is resource access control, or authorization in its broader sense. In this paper we present an authorization framework for m...
ABSTRACT. In this paper a secure communication method is proposed, based on left invertibility of output-quantized dynamical systems. The sender uses an output-quantized linear sys...
— In a typical mobile ad hoc network, mobile computing devices wander autonomously and communicate via temporary links in a self-organized computing system without any central ad...