Sciweavers

580 search results - page 32 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
UAI
2003
15 years 3 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
WSC
2001
15 years 3 months ago
Deterministic fluid models of congestion control in high-speed networks
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
Sanjay Shakkottai, R. Srikant
EUROCAST
2005
Springer
84views Hardware» more  EUROCAST 2005»
15 years 8 months ago
A Tractable Subclass of Fuzzy Constraint Networks
The Fuzzy Constraint Networks model, a generalization of the Disjunctive Temporal Fuzzy Constraint Networks, is a framework that allows representing and reasoning with fuzzy qualit...
Alfonso Bosch, Francisco Guil, Roque Marín
122
Voted
ICSE
2008
IEEE-ACM
16 years 3 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su
137
Voted
UAI
1997
15 years 3 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