Sciweavers

537 search results - page 105 / 108
» On Using Monte Carlo Methods for Scheduling
Sort
View
NECO
2007
129views more  NECO 2007»
13 years 7 months ago
Variational Bayes Solution of Linear Neural Networks and Its Generalization Performance
It is well-known that, in unidentifiable models, the Bayes estimation provides much better generalization performance than the maximum likelihood (ML) estimation. However, its ac...
Shinichi Nakajima, Sumio Watanabe
DAC
2005
ACM
14 years 8 months ago
Robust gate sizing by geometric programming
We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporat...
Jaskirat Singh, Vidyasagar Nookala, Zhi-Quan Luo, ...
INFORMATICALT
2002
150views more  INFORMATICALT 2002»
13 years 7 months ago
Search for Dynamic Equilibrium in Duel Problems by Global Optimization
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
Raimundas Matulevicius
UAI
2000
13 years 8 months ago
Being Bayesian about Network Structure
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...
Nir Friedman, Daphne Koller
ICASSP
2009
IEEE
14 years 2 months ago
Convex analysis based minimum-volume enclosing simplex algorithm for hyperspectral unmixing
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
Tsung-Han Chan, Chong-Yung Chi, Yu-Min Huang, Wing...