Sciweavers

3571 search results - page 471 / 715
» Cohen and Set Theory
Sort
View
COLT
1999
Springer
15 years 11 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
15 years 10 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
ARGMAS
2007
Springer
15 years 10 months ago
Arguing and Explaining Classifications
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent knowledge, based on the construction and the comparison of arguments. In this pape...
Leila Amgoud, Mathieu Serrurier
BIRTHDAY
2006
Springer
15 years 10 months ago
Some Varieties of Equational Logic
d Abstract) Gordon Plotkin1, LFCS, School of Informatics, University of Edinburgh, UK. The application of ideas from universal algebra to computer science has long been a major the...
Gordon D. Plotkin
FSKD
2006
Springer
298views Fuzzy Logic» more  FSKD 2006»
15 years 10 months ago
Risk Assessment of E-Commerce Projects Using Evidential Reasoning
The purpose of this study is to develop a decision making system to evaluate the risks in E-Commerce (EC) projects. Competitive software businesses have the critical task of assess...
Rashid Hafeez Khokhar, David A. Bell, Jiwen Guan, ...