Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

D-FLAT^2 : Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy

Bliem B., Charwat G., Hecher M., Woltran S.

Fundamenta Informaticae

2016

Vol. 147, nr 1

27--61

Many problems from the area of AI have been shown tractable for bounded treewidth. In order to put such results into practice, quite involved dynamic programming (DP) algorithms on tree decompositions have to be designed and implemented. These algorithms typically show recurring patterns that call for tasks like subset minimization. In this paper we present a novel approach to obtain such DP algorithms from simpler principles, where the DP formalization of subset minimization is performed automatically. We first give a theoretical account of our novel method, and then present D-FLAT^2, a system that allows one to specify the core DP algorithm via answer set programming (ASP). We illustrate the approach at work by providing several DP algorithms that are more space-efficient than existing solutions, while featuring improved readability, reuse and therefore maintainability of ASP code. Experiments show that our approach also yields a significant improvement in runtime performance.

Developing a conceptual framework for planning ramp-up costs

Kaluza B., Winkler H., Slamanig M, Bliem B.

Logistyka

2007

nr 1

CD-CD

Due to the fact that an efficient execution of production ramp-ups strongly impacts the economical success of a new product, ramp-up management shifted into the centre of scientific and practical interest in recent years. Despite great efforts, many important problems could not be solved so far. One of the unsolved problems concerns the planning and controlling of ramp-up costs. Up to now ramp-up costs are often insufficiently planned and controlled. Adequate methods and/or instruments are still missing. In this contribution we develop a key metric system to improve the planning of ramp-up costs by reducing complexity within the ramp-up planning process and increasing transparency. We demonstrate how this key metric system can be systematically built. Used consequently, this approach helps to increase the quality in planning ramp-up costs as well as the planning reliability.