357 search results - page 12 / 72 » Solving Generalized Maximum Dispersion with Linear Programmi... |
VMCAI
2009
Springer
15 years 4 months ago
2009
Springer
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
AMAI
2006
Springer
14 years 9 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
OL
2010
14 years 8 months ago
2010
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by r...
135
click to vote
CIDM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—A variational approach is proposed for the unsupervised assessment of attribute variability of high-dimensional data given a differentiable similarity measure. The key q...