Sciweavers

7150 search results - page 428 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
UAI
1996
15 years 8 months ago
Asymptotic Model Selection for Directed Networks with Hidden Variables
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
Dan Geiger, David Heckerman, Christopher Meek
ICSM
2002
IEEE
15 years 11 months ago
Evaluating Context-Sensitive Slicing and Chopping
We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. B...
Jens Krinke
CHARME
1997
Springer
105views Hardware» more  CHARME 1997»
15 years 10 months ago
Simulation-based verification of network protocols performance
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Pa...
244
Voted
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 9 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
GECCO
2006
Springer
142views Optimization» more  GECCO 2006»
15 years 10 months ago
Classifier prediction based on tile coding
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...