Sciweavers

2702 search results - page 383 / 541
» Practically Applicable Formal Methods
Sort
View
NIPS
2007
15 years 3 months ago
A Game-Theoretic Approach to Apprenticeship Learning
We study the problem of an apprentice learning to behave in an environment with an unknown reward function by observing the behavior of an expert. We follow on the work of Abbeel ...
Umar Syed, Robert E. Schapire
103
Voted
JCIT
2008
112views more  JCIT 2008»
15 years 2 months ago
On the design of metric relations
Metric distances and the more general concept of dissimilarities are widely used tools in instance-based learning methods and very especially in the nearestneighbor classification...
Lluís Belanche, Jorge Orozco
IJCM
2002
73views more  IJCM 2002»
15 years 2 months ago
Space-Time Equations for Non-Unimodular Mappings
Abstract. The class of systems of uniform recurrence equations (UREs) is closed under unimodular transformations. As a result, every systolic array described by a unimodular mappin...
Jingling Xue, Patrick M. Lenders
132
Voted
STTT
2010
122views more  STTT 2010»
15 years 19 days ago
Rodin: an open toolset for modelling and reasoning in Event-B
Event-B is a formal method for system-level modelling and analysis. Key features of Event-B are the use of set theory as a modelling notation, the use of ent to represent systems a...
Jean-Raymond Abrial, Michael J. Butler, Stefan Hal...
142
Voted
JMLR
2010
145views more  JMLR 2010»
14 years 9 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever