Sciweavers

1941 search results - page 276 / 389
» On the Hardness of Approximate Reasoning
Sort
View
LICS
2007
IEEE
16 years 16 days ago
Limits of Multi-Discounted Markov Decision Processes
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, dep...
Hugo Gimbert, Wieslaw Zielonka
ILP
2007
Springer
16 years 12 days ago
Bias/Variance Analysis for Relational Domains
Bias/variance analysis is a useful tool for investigating the performance of machine learning algorithms. Conventional analysis decomposes loss into errors due to aspects of the le...
Jennifer Neville, David Jensen
RR
2007
Springer
16 years 11 days ago
A Semantic Framework for Language Layering in WSML
Abstract. WSML presents a framework encompassing different language variants, rooted in Description Logics and (F-)Logic Programming. So far, the precise relationships between thes...
Jos de Bruijn, Stijn Heymans
CSFW
2006
IEEE
16 years 10 days ago
Decentralized Robustness
Robustness links confidentiality and integrity properties of a computing system and has been identified as a useful property for characterizing and enforcing security. Previous ...
Stephen Chong, Andrew C. Myers
GLOBECOM
2006
IEEE
16 years 9 days ago
Scalable Hierarchical Traceback
—Distributed Denial of Service attacks have recently emerged as one of the most potent, if not the greatest, weaknesses of the Internet. Previous solutions for this problem try t...
Arjan Durresi, Vamsi Paruchuri