Sciweavers

5159 search results - page 721 / 1032
» Structural Testing of Executables
Sort
View
CORR
1999
Springer
124views Education» more  CORR 1999»
15 years 7 months ago
An Algebraic Programming Style for Numerical Software and its Optimization
The abstract mathematical theory of partial differential equations (PDEs) is formulated in terms of manifolds,scalar fields, tensors, and the like, but these algebraic structures a...
T. B. Dinesh, Magne Haveraaen, Jan Heering
IJAR
2010
130views more  IJAR 2010»
15 years 5 months ago
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
Tomi Silander, Teemu Roos, Petri Myllymäki
IOR
2010
72views more  IOR 2010»
15 years 5 months ago
Inventory Control with Generalized Expediting
We consider a single-item, periodic review inventory control problem where discrete stochastic demand must be satisfied. When shortages occur, the unmet demand must be filled by...
Eric Logan Huggins, Tava Lennon Olsen
JMLR
2010
155views more  JMLR 2010»
15 years 5 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
LICS
2010
IEEE
15 years 5 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe