Search for dissertations about: "Branch and bound"
Showing result 16 - 20 of 39 swedish dissertations containing the words Branch and bound.
-
16. Contributions to program- and specification-based test data generation
Abstract : Software testing is complex and time consuming. One way to reduce testing effort is to automatically generate test data. In the first part of this thesis we consider a framework by Gupta et al. for generating tests from programs. READ MORE
-
17. The Impact of Application and Architecture Properties on Real-Time Multiprocessor Scheduling
Abstract : Guaranteeing the temporal correctness of a real-time system is a very challenging problem since application and architecture properties may be hard to model accurately. For example, modern computer architectures are typically equipped with mechanisms, such as cache memories and instruction pipelines, whose behavior are by nature stochastic. READ MORE
-
18. Techniques for Automatic Generation of Tests from Programs and Specifications
Abstract : Software testing is complex and time consuming. One way to reduce the effort associated with testing is to generate test data automatically. This thesis is divided into three parts. In the first part a mixed-integer constraint solver developed by Gupta et. READ MORE
-
19. New process integration methods for heat-saving retrofit projects in industrial systems
Abstract : New graphical methods for HEN retrofit (further development of existing tools), release of usable excess heat and placement of supply tanks in HWWS systems have been developed. In addition, further development of the matrix method for HEN retrofit has been made. READ MORE
-
20. A Study of Combinatorial Optimization Problems in Industrial Computer Systems
Abstract : A combinatorial optimization problem is an optimization problem where the number of possible solutions are finite and grow combinatorially with the problem size. Combinatorial problems exist everywhere in industrial systems. READ MORE