نتایج جستجو برای: generalized implicit enumeration
تعداد نتایج: 220967 فیلتر نتایج به سال:
The additive algorithm was one of the early versions of the approach known as implicit enumeration or branch and bound. It solves a linear program in n 0-1 variables by systematically enumerating an (often small) subset of the 2” possible binary n-vectors, while using the logical implications of the 0-1 property to ensure that the whole set is implicitly examined. [The Science Citation Index® (...
In this paper, we present our new worst-case execution time (WCET) analysis tool for Java processors, supporting both implicit path enumeration (IPET) and model checking based execution time estimation. Even though model checking is significantly more expensive than IPET, it simplifies accurate modeling of pipelines and caches. Experimental results using the UPPAAL model checker indicate that m...
With the increase in the complexity of VLSI circuit design, logic design errors can occur during synthesis. In this work, we present a method for multiple design error diagnosis and correction. Our approach uses the results of test vector simulation for both error detection and error correction. This makes it applicable to circuits with no global BDD representation. In addition, diagnosis is pe...
In this paper, we consider the problem of computing an optimal branch decomposition of a graph. Branch decompositions and branchwidth were introduced by Robertson and Seymour in their series of papers that proved the Graph Minors Theorem. Branch decompositions have proven to be useful in solving many NP-hard problems, such as the traveling salesman, independent set, and ring routing problems, b...
We present dual heuristics for the directed cut formulation of the Steiner problem in graphs. These heuristics usually give tight lower and upper bounds, and are enough to quickly solve two thirds of the instances from the literature. For harder instances, we propose two exact algorithms using those heuristics: branch-and-ascent, an implicit enumeration without LP solving; and a branch-and-cut ...
A number of examples are given where one seeks a minimal-cost tree to span a given subset of the nodes of a connected, directed, acyclic graph (we call such a graph monotonic). Some of these examples require an al~orithm to transform the problem into the form of a minimization problem in a monotonic graph.; this algorithm is also given. Finally, an implicit enumeration algorithm is presented fo...
We present an efficient algorithm for identification of two-line bridges in combinational CMOS logic that narrows down the two-line bridge candidates based on tester responses for voltage tests. Due to the implicit enumeration of bridge sites, no layout extraction or precomputed stuck-at fault dictionaries are required. The bridge identification is easily refined using additional test pattern r...
Branch-and-bound methods (also called implicit enumeration methods when the branching is done on binary variables) have proved to perform well on many combinatorial optimization problems, provided good bounding functions are known. Quite surprisingly, as emphasized in [3], they have not been studied widely in a multi-objective setting, i.e. when each solution s in the set S of feasible solution...
This paper introduces a method for bounding the worst-case performance of programs running on multithreaded processors, such as the embedded cores found within network processors (NPs). Worst-case bounds can be useful in determining whether a given software implementation will provide stable (e.g., line rate) performance under all traffic conditions. Our method extends an approach from the real...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید