The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This study propose to extend performance analysis of mainly Brute force and Heuristics algorithms on tree search problems. The most important goal is to look for optimization by punching holes in existing theory. The outcome will give a new dimension to traditional values like formulation of intelligent and speculative searches with improvement in time and space complexities. A series of observations...
The search for optimal multicast subgraphs for network coding is considered. We assume unit link capacities and binary flow rates. In the first version of the problem, there is no constraint on the acyclicity of the subgraphs, whereas such constraints are imposed in the second version. These problems are known to be NP-hard. We provide heuristics to deal with both versions of the problem. The heuristics...
Hardware/software (HW/SW) partitioning is one of the key challenges in HW/SW codesign. This paper presents efficient algorithms for the HW/SW partitioning problem, which has been proved to be NP-hard. We reduce the HW/SW partitioning problem to a variation of knapsack problem that is approximately solved by searching 1D solution space, instead of searching 2D solution space in the latest work cited...
Hardware/software (HW/SW) partitioning is one of the key challenges in HW/SW co-design. This paper presents a new formulation to handle the HW/SW partitioning problem, which has been proved to be NP-hard. The proposed formulation transforms the partitioning problem into an extended 0-1 knapsack problem that is approximately solved in this paper by scanning a one-dimensional search space, instead of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.