Sciweavers

564 search results - page 60 / 113
» Approximation algorithms for restricted Bayesian network str...
Sort
View
127
Voted
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 6 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
112
Voted
UAI
2004
15 years 2 months ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
MST
2007
167views more  MST 2007»
15 years 4 days ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
106
Voted
NIPS
2007
15 years 2 months ago
A neural network implementing optimal state estimation based on dynamic spike train decoding
It is becoming increasingly evident that organisms acting in uncertain dynamical environments often employ exact or approximate Bayesian statistical calculations in order to conti...
Omer Bobrowski, Ron Meir, Shy Shoham, Yonina C. El...
127
Voted
METMBS
2003
255views Mathematics» more  METMBS 2003»
15 years 2 months ago
Causal Explorer: A Causal Probabilistic Network Learning Toolkit for Biomedical Discovery
Causal Probabilistic Networks (CPNs), (a.k.a. Bayesian Networks, or Belief Networks) are well-established representations in biomedical applications such as decision support system...
Constantin F. Aliferis, Ioannis Tsamardinos, Alexa...