Sciweavers

250 search results - page 6 / 50
» Fixed Argument Pairings
Sort
View
103
Voted
JAR
2006
87views more  JAR 2006»
15 years 1 months ago
Elimination Transformations for Associative-Commutative Rewriting Systems
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
Keiichirou Kusakari, Masaki Nakamura, Yoshihito To...
AAAI
2006
15 years 3 months ago
Explaining Qualitative Decision under Uncertainty by Argumentation
Decision making under uncertainty is usually based on the comparative evaluation of different alternatives by means of a decision criterion. In a qualitative setting, pessimistic ...
Leila Amgoud, Henri Prade
131
Voted
ICML
2001
IEEE
16 years 2 months ago
Direct Policy Search using Paired Statistical Tests
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
Malcolm J. A. Strens, Andrew W. Moore
122
Voted
PAMI
2007
169views more  PAMI 2007»
15 years 1 months ago
Estimating Optimal Parameters for MRF Stereo from a Single Image Pair
—This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterio...
Li Zhang, Steven M. Seitz
CADE
2007
Springer
16 years 2 months ago
Predictive Labeling with Dependency Pairs Using SAT
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
Adam Koprowski, Aart Middeldorp