Search Sciweavers | Sciweavers

19

UAI
1989

103views Artificial Intelligence» more UAI 1989»

Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?

13 years 8 months ago

In this paper, the feasibility of using ﬁnite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...

Yang Xiang, Michael P. Beddoes, David Poole

claim paper

Read More »

15

click to vote

ICDCS
2008
IEEE

98views Distributed And Parallel Com...» more ICDCS 2008»

A Nonblocking Approach for Reaching an Agreement on Request Total Orders

14 years 1 months ago

Download www.cse.fau.edu

In distributed systems that use active replication to achieve robustness, it is important to efﬁciently enforce consistency among replicas. The nonblocking mode helps to speed u...

Yun Wang, Jie Wu

claim paper

Read More »

21

click to vote

AAAI
1996

122views Intelligent Agents» more AAAI 1996»

Total-Order Multi-Agent Task-Network Planning for Contract Bridge

13 years 8 months ago

Download www.cs.umd.edu

This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...

Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop

claim paper

Read More »

19

click to vote

CADE
2004
Springer

114views Logical Reasoning» more CADE 2004»

Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract

14 years 7 months ago

Download users.info.unicaen.fr

Àngel J. Gil, Bruno Zanuttini, Gernot Salze...

claim paper