Results for:
"
Rina+Brundu
" in Documents
- Processing Disjunctions in Temporal Constraint Networks 1997
- The framework of Temporal constraint Satisfaction Problems (TCSP) has been proposed for representing and processing temporal knowledge. Deciding consistency of TCSPs is known to be intractable. As dem...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 13-05-09
- Mini-Buckets A General Scheme for Approximating Inference 1998
- The paper describes a class of approximation algorithms that apply the idea of local inference, known as i-consistency in constraint networks, to combinatorial optimization and to probabilistic reason...
-
Rating:
Views: (1008)
Pages: ()
Uploaded: 13-05-09
- Directional Resolution The Davis-Putnam Procedure Revisited 1994
- The paper presents an algorithm called directional resolution, a variation on the original Davis-Putnam algorithm, and analyzes its worst-case behavior as a function of the topological structure of pr...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 13-05-09
- Empirical evaluation of two versions of the Davis-Putnam algorithm
- This paper summarizes the author's paper (presented in KR-94 and titled "Directional Resolution: The Davis-Putnam Procedure, Revisited" [Dechter and Rish, 1994]), focusing on its empirical aspects. It...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 13-05-09
- Mini-Buckets A General Scheme for Approximating Inference 1998
- This paper presents a class of approximate inference algorithms, based on bucket elimination [13], that trade accuracy for efficiency in cases when computational resources are bounded. Our approach ap...
-
Rating:
Views: (1010)
Pages: ()
Uploaded: 13-05-09
- Relieving Hot Spots on the World Wide Web 1997 4 citations ? 0 self
- We describe a family of caching protocols for distributed networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Hot spots are web sites that swamped by a large...
-
Rating:
Views: (1009)
Pages: ()
Uploaded: 13-05-09
- Relieving Hot Spots on the World Wide Web 1997 4 citations ? 0 self
- We describe a family of caching protocols for distributed networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Hot spots are web sites that swamped by a large...
-
Rating:
Views: (1014)
Pages: ()
Uploaded: 15-05-09
- Relieving Hot Spots on the World Wide Web 1997 4 citations ? 0 self
- We describe a family of caching protocols for distributed networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Hot spots are web sites that swamped by a large...
-
Rating:
Views: (1008)
Pages: ()
Uploaded: 15-05-09