—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...
Abstract. We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this form...
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...