837 search results - page 145 / 168 » Proof Development with OMEGA |
ICDM
2009
IEEE
13 years 7 months ago
2009
IEEE
In this paper, we restudy the non-convex data factorization problems (regularized or not, unsupervised or supervised), where the optimization is confined in the nonnegative orthan...
ICST
2009
IEEE
13 years 7 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cov...
IFIP
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
ICFP
2012
ACM
12 years 8 days ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...