MP
2010
13 years 11 months ago
2010
: Each linear program (LP) has an optimal basis. The space of linear programs can be partitioned according to these bases, so called the basis partition. Discovering the structures...
IPCO
2010
13 years 11 months ago
2010
In the classical secretary problem an employer would like to choose the best candidate among
JMLR
2006
14 years 12 days ago
2006
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
ENTCS
2006
14 years 13 days ago
2006
In previous work we proposed Linear Programs as a fine grained model for imperative programs, and showed how the model checking procedure used in SLAM can be generalised to a mode...
DISOPT
2008
14 years 15 days ago
2008
A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain c...
CG
2006
Springer
14 years 4 months ago
2006
Springer
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
ICFEM
2004
Springer
14 years 5 months ago
2004
Springer
Iterative abstraction refinement has emerged in the last few years as the leading approach to software model checking. In this context Boolean programs are commonly employed as si...
KBSE
2007
IEEE
14 years 6 months ago
2007
IEEE
We describe EUREKA, a symbolic model checker for Linear Programs with arrays, i.e. programs where variables and array elements range over a numeric domain and expressions involve ...