Sciweavers

281 search results - page 45 / 57
» Planning with Partial Preference Models
Sort
View
ICPR
2006
IEEE
14 years 9 months ago
Competitive Mixtures of Simple Neurons
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...
LPNMR
1993
Springer
14 years 15 days ago
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...
AAAI
2008
13 years 10 months ago
Maximum Entropy Inverse Reinforcement Learning
Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recoveri...
Brian Ziebart, Andrew L. Maas, J. Andrew Bagnell, ...
ATAL
2008
Springer
13 years 10 months ago
Checking correctness of business contracts via commitments
Business contracts tend to be complex. In current practice, contracts are often designed by hand and adopted by their participants after, at best, a manual analysis. This paper mo...
Nirmit Desai, Nanjangud C. Narendra, Munindar P. S...
BMCBI
2010
120views more  BMCBI 2010»
13 years 8 months ago
Optimal contact definition for reconstruction of Contact Maps
Background: Contact maps have been extensively used as a simplified representation of protein structures. They capture most important features of a protein's fold, being pref...
Jose M. Duarte, Rajagopal Sathyapriya, Henning Ste...