4757 search results - page 131 / 952 » Monads for Functional Programming |
119
Voted
ISIPTA
2003
IEEE
15 years 8 months ago
2003
IEEE
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
109
click to vote
MP
2006
15 years 2 months ago
2006
We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value fun...
142
Voted
TMI
2008
15 years 2 months ago
2008
This paper introduces a 2-D strain imaging technique based on minimizing a cost function using dynamic programming (DP). The cost function incorporates similarity of echo amplitude...
145
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
108
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...