245 search results - page 14 / 49 » Efficient Solving of Time-dependent Answer Set Programs |
112
click to vote
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
102
click to vote
UAI
2004
15 years 1 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
134
click to vote
ICLP
2003
Springer
15 years 5 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
ESANN
2008
15 years 1 months ago
2008
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
CADE
2006
Springer
16 years 3 days ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...