Sciweavers

4007 search results - page 132 / 802
» Computation with imprecise probabilities
Sort
View
AMAI
2002
Springer
15 years 3 months ago
Probabilistic Argumentation Systems and Abduction
Probabilistic argumentation systems are based on assumption-based reasoning for obtaining arguments supporting hypotheses and on probability theory to compute probabilities of sup...
Jürg Kohlas, Dritan Berzati, Rolf Haenni
132
Voted
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
15 years 3 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
EMNLP
2009
15 years 1 months ago
Person Cross Document Coreference with Name Perplexity Estimates
The Person Cross Document Coreference systems depend on the context for making decisions on the possible coreferences between person name mentions. The amount of context required ...
Octavian Popescu
136
Voted
ORL
2010
167views more  ORL 2010»
14 years 10 months ago
An embedded Markov chain approach to stock rationing
Rationing is an inventory policy that allows prioritization of demand classes. It enables the inventory system to provide higher service levels for critical demand classes. In thi...
Mehmet Murat Fadiloglu, Önder Bulut
MFCS
2000
Springer
15 years 7 months ago
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey
The probability of a property on the collection of all finite relational structures is the limit as
Phokion G. Kolaitis, Moshe Y. Vardi