Sciweavers

2520 search results - page 317 / 504
» The complexity of approximating entropy
Sort
View
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
15 years 11 months ago
Discretization of Linear Fractional Representations of LPV systems
Abstract— Commonly, controllers for Linear ParameterVarying (LPV) systems are designed in continuous-time using a Linear Fractional Representation (LFR) of the plant. However, th...
Roland Tóth, Marco Lovera, Peter S. C. Heub...
RT
2001
Springer
15 years 11 months ago
Opacity Shadow Maps
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
Tae-Yong Kim 0002, Ulrich Neumann
IJCNN
2000
IEEE
15 years 11 months ago
On MCMC Sampling in Bayesian MLP Neural Networks
Bayesian MLP neural networks are a flexible tool in complex nonlinear problems. The approach is complicated by need to evaluate integrals over high-dimensional probability distri...
Aki Vehtari, Simo Särkkä, Jouko Lampinen
ANTS
2000
Springer
87views Algorithms» more  ANTS 2000»
15 years 11 months ago
Reduction in Purely Cubic Function Fields of Unit Rank One
This paper analyzes reduction of fractional ideals in a purely cubic function field of unit rank one. The algorithm is used for generating all the reduced principal fractional ide...
Renate Scheidler
TACAS
1998
Springer
131views Algorithms» more  TACAS 1998»
15 years 10 months ago
Detecting Races in Relay Ladder Logic Programs
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL...
Alexander Aiken, Manuel Fähndrich, Zhendong S...