Sciweavers

792 search results - page 35 / 159
» Value Based Argumentation Frameworks
Sort
View
POLICY
2005
Springer
14 years 3 months ago
Approximating Service Utility from Policies and Value Function Patterns
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
Steffen Lamparter, Daniel Oberle, Andreas Eberhart
UAI
2000
13 years 11 months ago
Value-Directed Belief State Approximation for POMDPs
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
Pascal Poupart, Craig Boutilier
DAGSTUHL
2007
13 years 11 months ago
Two-Dimensional Belief Change
ABSTRACT: In this paper I present the model of ‘bounded revision’ that is based on two-dimensional revision functions taking as arguments pairs consisting of an input sentence ...
Hans Rott
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
14 years 10 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
LICS
2010
IEEE
13 years 8 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky