—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
—Providing anonymity to routes in a wireless ad hoc network from passive eavesdroppers is considered. Using Shannon’s equivocation as an information theoretic measure of anonym...
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
Six basic notions concerning business processes and their supporting information systems are presented and discussed, on the basis of one common theory. This yields that these noti...
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...