1615 search results - page 40 / 323 » Computer science and decision theory |
DIS
2008
Springer
13 years 9 months ago
2008
Springer
Decision trees are among the most effective and interpretable classification algorithms while ensembles techniques have been proven to alleviate problems regarding over-fitting and...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
We propose a new type of canonical decision diagrams, which allows a more efficient symbolic state-space generation for general asynchronous systems by allowing on-the-fly extensi...
ERSHOV
2001
Springer
14 years 4 days ago
2001
Springer
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
RTA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
GI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract: This paper presents a multiagent architecture and algorithms for collaborative, self-organizing learning in distributed, heterogeneous and dynamic business systems, where...