Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
This paper presents a novel discrete population based stochastic optimization algorithm inspired from weed colonization. Its performance in a discrete benchmark, timecost trade-off...
This work describes a stochastic approach for the optimal placement of sensors in municipal water networks to detect maliciously injected contaminants. The model minimizes the exp...