499 search results - page 48 / 100 » A Dynamic-Programming Based ASP-Solver |
WEA
2010
Springer
14 years 5 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
IROS
2009
IEEE
14 years 5 months ago
2009
IEEE
— This paper presents a standing balance controller. We employ a library of optimal trajectories and the neighboring optimal control method to generate local approximations to th...
ALDT
2009
Springer
14 years 5 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
WABI
2009
Springer
14 years 5 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
MFCS
2009
Springer
14 years 5 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...