18306 search results - page 16 / 3662 » Algorithmics in Exponential Time |
ECAI
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
IJCAI
1993
13 years 9 months ago
1993
Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first tr...
KR
2000
Springer
13 years 11 months ago
2000
Springer
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculati...
RTSS
2008
IEEE
14 years 2 months ago
2008
IEEE
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
IJCAI
2007
13 years 9 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...