Sciweavers

3307 search results - page 631 / 662
» The meaning of concurrent programs
Sort
View
IJCAI
1997
15 years 5 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
154
Voted
UAI
1997
15 years 5 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
ATAL
2010
Springer
15 years 5 months ago
Alternating-time dynamic logic
We propose Alternating-time Dynamic Logic (ADL) as a multi-agent variant of Dynamic Logic in which atomic programs are replaced by coalitions. In ADL, the Dynamic Logic operators ...
Nicolas Troquard, Dirk Walther
BMCBI
2010
109views more  BMCBI 2010»
15 years 4 months ago
Free energy estimation of short DNA duplex hybridizations
Background: Estimation of DNA duplex hybridization free energy is widely used for predicting cross-hybridizations in DNA computing and microarray experiments. A number of software...
Dan C. Tulpan, Mirela Andronescu, Serge Leger
BMCBI
2007
185views more  BMCBI 2007»
15 years 4 months ago
GEDI: a user-friendly toolbox for analysis of large-scale gene expression data
Background: Several mathematical and statistical methods have been proposed in the last few years to analyze microarray data. Most of those methods involve complicated formulas, a...
André Fujita, João Ricardo Sato, Car...