ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
Graph-based similarity over WordNet has been previously shown to perform very well on word similarity. This paper presents a study of the performance of such a graph-based algorit...
Eneko Agirre, Montse Cuadros, German Rigau, Aitor ...
Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an ...
We consider a firm that faces random demand and receives product from a single supplier who faces random supply. The supplier's availability may be affected by events such as...
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman