Results 11 - 20
of
3,690
Auctions in Electronic Commerce - Efficiency versus Computational Tractability
, 1998
"... In Electronic Commerce, the intra-organizational coordination of directly responsible units, e. g. profitcenters or firms within an affiliated group, is of increasing importance. These organizational units can be modeled within a Multi-Agent System (MAS), an interconnection of autonomous inform ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
of data, limitations of time for planning and the intractability of computational problems.
Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- J. OF AUTOMATED REASONING
, 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract
-
Cited by 497 (123 self)
- Add to MetaCart
We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base
L. BREUER: TWO EXAMPLES FOR COMPUTATIONALLY TRACTABLE PERIODIC QUEUES TWO EXAMPLES FOR COMPUTATIONALLY TRACTABLE PERIODIC QUEUES
"... Abstract: In the present paper, the periodic ¢¡¤£¦¥¦§¨¡�©�§� � queue is analyzed. This queue has a periodic BMAP arrival process, which is defined in this paper, and exponential service time distributions with service rates varying periodically in time. The transient distribution and several formul ..."
Abstract
- Add to MetaCart
formulae for its efficient computation are derived. Furthermore, a stability condition in terms of arrival and service rates is proven, and for the case of stability the asymptotic distribution is given explicitly. A special class of periodic ¢¡¤£�¥¦§� ¡ © §� � queues, which allows to reduce
1Computationally-tractable approximate PHD and CPHD filters for superpositional sensors
"... Abstract—In this paper we derive computationally-tractable approximations of the Probability Hypothesis Density (PHD) and Cardinalized Probability Hypothesis Density (CPHD) filters for superpositional sensors with Gaussian noise. We present imple-mentations of the filters based on auxiliary particle ..."
Abstract
- Add to MetaCart
Abstract—In this paper we derive computationally-tractable approximations of the Probability Hypothesis Density (PHD) and Cardinalized Probability Hypothesis Density (CPHD) filters for superpositional sensors with Gaussian noise. We present imple-mentations of the filters based on auxiliary
PIC Matrices: A Computationally Tractable Class of Probabilistic Query Operators
"... this paper, we present a class of query operators which, for reasons to be explained, we have called pic operators. The pic operators comprise a subclass of the general class of query operators that are expressible within the inference network framework. The subclass has been chosen to satisfy two i ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
important design criteria: 1) the operators belonging to the subclass are computationally tractable, and 2) they are intuitively plausible candidates for the modeling of query operators. A wide variety of query operators can be defined as pic operators. The work reported has been principally motivated
Computationally Tractable Model of Energy Detection Performance Over Slow Fading Channels
- IEEE Commun. Letters
, 2010
"... Abstract—Energy detection (ED) has been widely used for detecting unknown deterministic signals in many wireless communication applications, e.g., cognitive radio, and ultra-wideband (UWB). However, the performance analysis of ED over slow fading channels is cumbersome, because it is difficult to de ..."
Abstract
-
Cited by 8 (4 self)
- Add to MetaCart
Abstract—Energy detection (ED) has been widely used for detecting unknown deterministic signals in many wireless communication applications, e.g., cognitive radio, and ultra-wideband (UWB). However, the performance analysis of ED over slow fading channels is cumbersome, because it is difficult to derive closed-form expressions for the average probability of detection involving the generalised Marcum Q-function and the log-normal distribution. In this letter, we derive an approximation of the average probability of detection over a slow fading channel by replacing the log-normal distribution with a Wald distribution. In addition, we analyze the detection performance of the ED using a square-law combining scheme over multiple independent and identically distributed slow fading channels. Index Terms—Energy detection, slow fading, cognitive radio, UWB, Wald distribution. I.
Blocking Parameterizations for Improving the Computational Tractability of Affine Disturbance Feedback MPC Problems
"... Abstract — Many robust model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can result in computationally intractable problems. So-called move-blocking is an effective method of redu ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
Abstract — Many robust model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can result in computationally intractable problems. So-called move-blocking is an effective method
Flows over Time: Towards a more Realistic and Computationally Tractable Model
, 2005
"... We introduce a novel model for “flows over time” which captures the behavior of cars traveling through a road network better than previous models. We show that computing an optimal solution in the new model is N P-hard and present an LP-based algorithm which we evaluate with several experiments on r ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
We introduce a novel model for “flows over time” which captures the behavior of cars traveling through a road network better than previous models. We show that computing an optimal solution in the new model is N P-hard and present an LP-based algorithm which we evaluate with several experiments
Computationally Tractable Inventory Control for Large-Scale Reverse Supply Chains
"... Abstract-We propose a new inventory control technique for largescale bidirectional (or closed-loop) supply chains including repairs. It is well-known that available optimization techniques are computationally intractable for bidirectional stochastic supply chains and also necessitate several simpli ..."
Abstract
- Add to MetaCart
Abstract-We propose a new inventory control technique for largescale bidirectional (or closed-loop) supply chains including repairs. It is well-known that available optimization techniques are computationally intractable for bidirectional stochastic supply chains and also necessitate several
Computationally Manageable Combinatorial Auctions
, 1998
"... There is interest in designing simultaneous auctions for situations in which the value of assets to a bidder depends upon which other assets he or she wins. In such cases, bidders may well wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue ma ..."
Abstract
-
Cited by 345 (1 self)
- Add to MetaCart
maximizing set of nonconflicting bids can be a difficult one. We analyze this problem, identifying several different structures of combinatorial bids for which computational tractability is constructively demonstrated and some structures for which computational tractability 1 Introduction Some auctions
Results 11 - 20
of
3,690