Sciweavers

4745 search results - page 77 / 949
» Discretization: An Enabling Technique
Sort
View
CSDA
2006
71views more  CSDA 2006»
15 years 6 months ago
Practical representations of incomplete probabilistic knowledge
This article deals with the compact representation of incomplete probabilistic knowledge which can be encountered in risk evaluation problems, for instance in environmental studie...
Cédric Baudrit, Didier Dubois
JAIR
2007
141views more  JAIR 2007»
15 years 6 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
ML
2007
ACM
144views Machine Learning» more  ML 2007»
15 years 5 months ago
Invariant kernel functions for pattern analysis and machine learning
In many learning problems prior knowledge about pattern variations can be formalized and beneficially incorporated into the analysis system. The corresponding notion of invarianc...
Bernard Haasdonk, Hans Burkhardt
SPRINGSIM
2010
15 years 4 months ago
Simplifying parallel and distributed simulation with the DUP system
This paper presents how the DUP System, a straightforward POSIX-compatible framework that enables programminglanguage-agnostic parallel and distributed stream processing, can be u...
Nathan S. Evans, Chris GauthierDickey, Christian G...
SIAMNUM
2011
110views more  SIAMNUM 2011»
15 years 1 months ago
A Posteriori Error Control for Discontinuous Galerkin Methods for Parabolic Problems
We derive energy-norm a posteriori error bounds for an Euler timestepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For acc...
Emmanuil H. Georgoulis, Omar Lakkis, Juha M. Virta...