258 search results - page 29 / 52 » Weak Bisimulation Approximants |
101
click to vote
AAAI
2012
13 years 2 months ago
2012
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
AAAI
2012
13 years 2 months ago
2012
We consider the problem of selecting fair divisions of a heterogeneous divisible good among a set of agents. Recent work (Cohler et al., AAAI 2011) focused on designing algorithms...
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we present a novel boosting algorithm for supervised learning that incorporates invariance to data transformations and has high generalization capabilities. While on...
115
click to vote
ACID
2006
15 years 1 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
102
click to vote
STOC
2001
ACM
16 years 1 days ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...