We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
Abstract. We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario...
Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muri...
This paper reports our investigation on the problem of belief update in Bayesian networks (BN) using uncertain evidence. We focus on two types of uncertain evidences, virtual evid...
A student's goals and attitudes while interacting with a tutor are typically unseen and unknowable. However their outward behavior (e.g. problem-solving time, mistakes and hel...
We present a novel camera network design methodology based on the Parisian approach to evolutionary computation. The problem is partitioned into a set of homogeneous elements, whos...