Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple-access channel with noiseless feedback (MAC-FB). We co...
Energy consumption of mobile readers is becoming an important issue as applications of RFID systems pervade different aspects of our lives. Surprisingly, however, these systems ar...
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to
Abstract. We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of pro...