We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
In our terminology, a “deliberation” is a distributed collaborative process, more or less spontaneous, structured, and complex. This process can include both individual and col...
Space, vast lands and dungeons… It is no coincidence that Space War and Adventure are among the best known of the first computer games. Both clearly appeal to the player’s cur...
Abstract. Pervasive computing creates possibilities for presenting highly personalised information about the people, places and things in a building. One of the challenges for such...
This is an introductory book about machine learning. Notice that this is a draft book. It may contain typos, mistakes, etc.
The book covers the following topics: Boolean Functio...