Results 1  10
of
4,811
Tractable Problems in Bayesian Networks
"... The complexity of probabilistic reasoning with Bayesian networks has recentlybeenproven to be NPcomplete. So reducing the complexity ofsuchnetworks is an active issue in uncertainty reasoning. Much work on such as compressing the probabilistic information for Bayesian networks and optimal approxima ..."
Abstract
 Add to MetaCart
approximation algorithm for Bayesian inference, has been suggested. In this paper, we study a class of tractable problems in Bayesian networks aiming at reducing their computing complexity from nonpolynomial amount to polynomial one. The main challenge for tractable problems in Bayesian networks
Pushing the EL envelope
 In Proc. of IJCAI 2005
, 2005
"... Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already int ..."
Abstract

Cited by 461 (59 self)
 Add to MetaCart
Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already
Robust convex optimization
 Mathematics of Operations Research
, 1998
"... We study convex optimization problems for which the data is not specified exactly and it is only known to belong to a given uncertainty set U, yet the constraints must hold for all possible values of the data from U. The ensuing optimization problem is called robust optimization. In this paper we la ..."
Abstract

Cited by 416 (21 self)
 Add to MetaCart
) the corresponding robust convex program is either exactly, or approximately, a tractable problem which lends itself to efficient algorithms such as polynomial time interior point methods.
Congestion control for high bandwidthdelay product networks
 SIGCOMM '02
, 2002
"... Theory and experiments show that as the perflow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes increasingly important as the Internet evolves to incorporate very highbandwidth optical links and mo ..."
Abstract

Cited by 454 (4 self)
 Add to MetaCart
and more largedelay satellite links. To address this problem, we develop a novel approach to Internet congestion control that outperforms TCP in conventional environments, and remains efficient, fair, scalable, and stable as the bandwidthdelay product increases. This new eXplicit Control Protocol, XCP
HYPERTREE DECOMPOSITIONS AND TRACTABLE QUERIES
, 1998
"... Several important decision problems on conjunctive queries (CQs) are NPcomplete in general but become tractable, and actually highly parallelizable, if restricted to acyclic or nearly acyclic queries. Examples are the evaluation of Boolean CQs and query containment. These problems were shown tracta ..."
Abstract

Cited by 165 (42 self)
 Add to MetaCart
Several important decision problems on conjunctive queries (CQs) are NPcomplete in general but become tractable, and actually highly parallelizable, if restricted to acyclic or nearly acyclic queries. Examples are the evaluation of Boolean CQs and query containment. These problems were shown
Adjustable robust solutions of uncertain linear programs
, 2004
"... We consider linear programs with uncertain parameters, lying in some prescribed uncertainty set, where part of the variables must be determined before the realization of the uncertain parameters (“nonadjustable variables”), while the other part are variables that can be chosen after the realization ..."
Abstract

Cited by 370 (12 self)
 Add to MetaCart
cases, equivalent to a tractable optimization problem (typically an LP or a Semidefinite problem), and in other cases, having a tight approximation which is tractable. The AARC approach is illustrated by applying it to a multistage inventory management problem.
Tractable conservative Constraint Satisfaction Problems
"... In a constraint satisfaction problem (CSP) the aim is to find an assignment of values to a given set of variables, subject to specified constraints. The CSP is known to be NPcomplete in general. However, certain restrictions on the form of the allowed constraints can lead to problems solvable in po ..."
Abstract

Cited by 118 (13 self)
 Add to MetaCart
In a constraint satisfaction problem (CSP) the aim is to find an assignment of values to a given set of variables, subject to specified constraints. The CSP is known to be NPcomplete in general. However, certain restrictions on the form of the allowed constraints can lead to problems solvable
The Computational Complexity of Propositional STRIPS Planning
 Artificial Intelligence
, 1994
"... I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Different planning problems can be defined by restricting the type of formulas, placing limits on the number of pre and postconditions, by restricting negation ..."
Abstract

Cited by 363 (3 self)
 Add to MetaCart
I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Different planning problems can be defined by restricting the type of formulas, placing limits on the number of pre and postconditions, by restricting negation
Tractable Reasoning via Approximation
 Artificial Intelligence
, 1995
"... Problems in logic are wellknown to be hard to solve in the worst case. Two different strategies for dealing with this aspect are known from the literature: language restriction and theory approximation. In this paper we are concerned with the second strategy. Our main goal is to define a semantical ..."
Abstract

Cited by 116 (0 self)
 Add to MetaCart
Problems in logic are wellknown to be hard to solve in the worst case. Two different strategies for dealing with this aspect are known from the literature: language restriction and theory approximation. In this paper we are concerned with the second strategy. Our main goal is to define a
Characterising Tractable Constraints
 Artificial Intelligence
, 1994
"... Finding solutions to a binary constraint satisfaction problem is known to be an NPcomplete problem in general, but may be tractable in cases where either the set of allowed constraints or the graph structure is restricted. This paper considers restricted sets of contraints which are closed under pe ..."
Abstract

Cited by 61 (19 self)
 Add to MetaCart
Finding solutions to a binary constraint satisfaction problem is known to be an NPcomplete problem in general, but may be tractable in cases where either the set of allowed constraints or the graph structure is restricted. This paper considers restricted sets of contraints which are closed under
Results 1  10
of
4,811