Sciweavers

1094 search results - page 63 / 219
» On Computing Explanations in Argumentation
Sort
View
CORR
2007
Springer
115views Education» more  CORR 2007»
14 years 11 months ago
FPRAS for computing a lower bound for weighted matching polynomial of graphs
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...
Shmuel Friedland
IICS
2001
Springer
15 years 3 months ago
Computer-Supported Deliberations for Distributed Teams
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...
Jacques Lonchamp, Fabrice Muller
DIGRA
2003
Springer
15 years 4 months ago
Exploration in computer games - a new starting point
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...
Simon Egenfeldt-Nielsen
UMUAI
2010
107views more  UMUAI 2010»
14 years 9 months ago
PERSONAF: framework for personalised ontological reasoning in pervasive computing
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...
William T. Niu, Judy Kay

Book
796views
16 years 10 months ago
Introduction to Machine Learning
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...
Nils J. Nilsson