3690 search results - page 96 / 738 » Computation with classical sequents |
117
click to vote
TLCA
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
127
click to vote
NIPS
1997
15 years 5 months ago
1997
Prioritized sweeping is a model-based reinforcement learning method that attempts to focus an agent’s limited computational resources to achieve a good estimate of the value of ...
134
click to vote
ICANN
2010
Springer
15 years 4 months ago
2010
Springer
Independent Component Analysis (ICA) is a statistical computation method that transforms a random vector in another one whose components are independent. Because the marginal distr...
178
click to vote
VISAPP
2007
15 years 5 months ago
2007
In this paper, we address the problem of robustly recovering several instances of a curve model from a single noisy data set with outliers. Using M-estimators revisited in a Lagran...
159
click to vote
TCS
2010
15 years 2 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...