Sciweavers

866 search results - page 92 / 174
» A Formal Investigation of
Sort
View
UAI
1997
13 years 11 months ago
Sequential Update of Bayesian Network Structure
There is an obvious need for improving the performance and accuracy of a Bayesian network as new data is observed. Because of errors in model construction and changes in the dynam...
Nir Friedman, Moisés Goldszmidt
CSL
2010
Springer
13 years 10 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann
ALGORITHMICA
2010
125views more  ALGORITHMICA 2010»
13 years 10 months ago
On the Fastest Vickrey Algorithm
We investigate the algorithmic performance of Vickrey-Clarke-Groves mechanisms in the single item case. We provide a formal definition of a Vickrey algorithm for this framework, a...
Elena Grigorieva, P. Jean-Jacques Herings, Rudolf ...
ISCI
2006
72views more  ISCI 2006»
13 years 10 months ago
A study of particle swarm optimization particle trajectories
Particle swarm optimization (PSO) has shown to be an efficient, robust and simple optimization algorithm. Most of the PSO studies are empirical, with only a few theoretical analys...
F. Van den Bergh, Andries Petrus Engelbrecht
JALC
2006
95views more  JALC 2006»
13 years 10 months ago
On the Decidability of Model-Checking for P Systems
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, n...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie