Sciweavers

309 search results - page 17 / 62
» Updating Probabilities
Sort
View
UAI
2008
14 years 10 days ago
Adaptive inference on general graphical models
Many algorithms and applications involve repeatedly solving variations of the same inference problem; for example we may want to introduce new evidence to the model or perform upd...
Umut A. Acar, Alexander T. Ihler, Ramgopal R. Mett...
AAAI
1997
14 years 8 days ago
Bayes Networks for Estimating the Number of Solutions to a CSP
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
Amnon Meisels, Solomon Eyal Shimony, Gadi Solotore...
ICTAI
2000
IEEE
14 years 3 months ago
Designing a learning-automata-based controller for client/server systems: a methodology
Abstract— Polling policies have been introduced to simplify the accessing process in client/server systems by a centralized control access scheme. This paper considers a client/s...
Georgios I. Papadimitriou, Athena Vakali, Andreas ...
TIT
2002
62views more  TIT 2002»
13 years 10 months ago
Maximum-likelihood binary shift-register synthesis from noisy observations
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...
Todd K. Moon
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 11 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen