Sciweavers

1724 search results - page 58 / 345
» Abstract Interpreters for Free
Sort
View
ICASSP
2011
IEEE
14 years 9 months ago
Fast adaptive variational sparse Bayesian learning with automatic relevance determination
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
Dmitriy Shutin, Thomas Buchgraber, Sanjeev R. Kulk...
POPL
1994
ACM
15 years 9 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
FLOPS
2008
Springer
15 years 7 months ago
EasyCheck - Test Data for Free
Abstract. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize t...
Jan Christiansen, Sebastian Fischer
SIAMCO
2008
83views more  SIAMCO 2008»
15 years 5 months ago
Necessary Conditions for Multiobjective Optimal Control Problems with Free End-Time
Abstract. Necessary conditions of optimality are derived for multiobjective optimal control problems with free end-time, in which the dynamics constraint is modeled as a nonconvex ...
B. T. Kien, N.-C. Wong, J. C. Yao
LATA
2009
Springer
16 years 5 days ago
On the Average Size of Glushkov's Automata
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...
Cyril Nicaud