نتایج جستجو برای: financial autarky
تعداد نتایج: 146250 فیلتر نتایج به سال:
Abstract Any calls to move towards a centrally planned economy or autarky are strongly advised against, as this would only be the detriment of food security in Global South.
Resolution has not been an eeective tool for deciding satissability of propositional CNF formulas, due to explosion of the search space, particularly when the formula is satissable. However, a new pruning method, which is designed to eliminate certain refutation attempts that cannot succeed, has been shown to eliminate much of the redundancy of propositional model elimination. The pruning metho...
Fiscal Union Consensus Design under the Risk of Autarky* Inspired by the current debate over the future of the monetary union in Europe, this paper provides a simple model for the determination of the conditions of survival of the common good, which requires the creation of an effective fiscal union. We highlight the importance of institutional design and varying decision weights for the enlarg...
Resolution has not been an eeective tool for deciding satissability of propositional CNF formulas, due to explosion of the search space, particularly when the formula is satissable. A new pruning method is described, which is designed to eliminate certain refutation attempts that cannot succeed. The method exploits the concept of \autarky", which was introduced by Monien and Speckenmeyer. New f...
Thermal energy storage technologies significantly increase the benefits of decentralized renewable production on residential scale. While many studies investigate singular applications thermal storages or provide a broad overview about current state research in this field, there is no comprehensive assessment market-ready solutions. This paper combines system performance analysis for combinatio...
The structure of the monoid of autarkies for clause-sets is investigated (autarkies are generalizations of satisfying (truth) assignments). The notion of a \plain clause-set" is introduced, where every clause is usable by some resolution refutation, and it is shown that a clause-set is plain ii it has no non-trivial autarky. Every clause-set has a unique decomposition into a plain sub-clause-se...
Resolution has not been an eeective tool for deciding satissability of propositional CNF formulas, due to explosion of the search space, particularly when the formula is satissable. However, a new pruning method, which is designed to eliminate certain refutation attempts that cannot succeed, has been shown to eliminate much of the redundancy of propositional model elimination. The pruning metho...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید