E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Genetic Algorithms and Their Applications to the Design of Neural.. - Jones (1993) (4 citations) (Correct)
....difference of Holland s approach was the incorporation of a crossover operator to mimic the effect of sexual reproduction. From another perspective, GAs fall into the class of Probabilistic Heuristic Algorithms which one might use to attack NP complete or NP hard problems (see, for example [Horowitz 1978], Chapters 11 and 12) such as the Travelling Salesperson Problem (TSP) many of which have significant applications in engineering hardware or software design and commercial optimisation problems. In this article we assume that the reader is familiar with the basic ideas of neural networks but ....
E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. London, Pitman Publishing Ltd.
The Path Compression Problem on Graphs - Chou, Yang (Correct)
....another heuristic algorithm by applying linear programming [2] In order to get the optimal solution, we restrict the linear programming to the 0 1 integer programming [1] We also show some experiment results. In the future, we may develop a new algorithm with the branch and bound strategy [4], the simulated annealing strategy [6] or the genetic strategy [7] or other strategies for solving NP complete problems. In this paper, we still have some open problems. Problem I: Is the vertex compression problem NP complete on general graphs Problem II: What is the tight bound of the ....
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. Computer Science Press, 1978.
Reconfigurable Mesh Algorithms For The Area And - Perimeter Of Image (Correct)
....by the National Science Fundation under grants DCR 84 20935 and MIP 8617374 2.1 Area 2.1.1 CRCW PRAM Algorithm It is instructive to first consider a CRCW PRAM version of our algorithm. We assume, for simplicity, that N is a power of 2. Our algorithm employs the divide and conquer approach [2]. Initially, we assume that each pixel is independent of the others; then we combine together blocks of pixels to obtain larger blocks. Two kinds of block combinations are performed. In one, we combine together two horizontally adjacent 2 blocks. In the other, two vertically adjacent 2 ....
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Inc., 1978.
Testing, Evaluation and Performance of Optimization.. - Whitley, Watson.. (2002) (Correct)
.... exists for the Euclidean Traveling Salesman Problem which is guaranteed to yield a solution that is no worse than 2C where C is the cost of an optimal solution [3] Branch and bound algorithms can use this information to compute bounds such that no solution with a cost greater than 2C is examined [7]. Thus, the existence of a ratio bound means that algorithms can select which performance vectors to explore, and this excludes some search behaviors (i.e. performance vectors) which are part of the permutation closure of the objective function. Many researchers have dismissed NFL using the ....
E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978.
IPSec/VPN Security Policy: Correctness, Conflict.. - Fu, Wu, Huang.. (2001) (2 citations) (Correct)
....whether or not break the single tunnel up at the node Ra. However, at the worst case, given a group of tunnels, we may need to test all possible configurations before an optimal one can be found. Among those optimization problems with solution as a n tuple ) 2 1 n x x x , backtracking [7] is a commonly used algorithm. The basic idea of the backtracking algorithm is to continuously build and test partial vector ) 2 1 x x x to see if it can possibly lead to an optimal solution. If not, then all possible values of latter part of vector ) 2 1 n i x x x can be ....
....calculation algorithm to find out the one with smallest penalty to be as our initial penalty. Although backtracking can vary greatly in time complexity for different problem instances, for a lot instances in large scale, backtracking indeed can find out solution in very short time. Monte Carlo [7] method can be used to estimate the efficiency of the backtracking algorithm for a specific instance. Besides backtracking algorithm, other algorithms like branch and bound [7] genetic algorithm [8] etc. can also be used for policy optimization problem. Genetic algorithm normally could get a good ....
[Article contains additional citation context not shown here]
Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Computer Science Press Inc.,1978.
Optimal Folding of Bit Sliced Stacks - Paik, Sahni (1993) Self-citation (Sahni) (Correct)
No context found.
E. Horowitz, and S. Sahni, "Fundamentals of Computer Algorithms", Computer Science Press, Maryland, 1978.
Optimal Folding Of Standard And Custom Cells - Thanvantri, Sahni Self-citation (Sahni) (Correct)
....at W, it is sutticient to minimize the sum of channel heights. Suppose that C1, Cs is folded at Ci in an optima folding X. Then the folding of C, Ci in X as well as that of Ci , Cs must be minimum area foldings. Hence, the principle of optimality holds and we can use dynamic programming [HORO78]. Let f(i, s) i s, denote the minimum sum of channel heights when the component list Ci, Cs is folded such that Ci, Cs are in one cell row and the first fold is at Cs (so, Cs l is in the next cell row) It is easy to see that f(n,n) In O. For i i s n, we get c if wis W ....
....ues. This cost can be charged towards deletion of F( values. The remaining code within the for loop takes O(n) amortized time. The complexity of the procedure MinimizeHtStan dard is clearly O(n) as no more than n deletions can take place. Using standard dynamic programming traceback techniques [HORO78], the fold points can be obtained in additional O(n) time. Problem 2, i.e, minimize total area rather than just routing area may be done in a 11 similar way. Let f(i, s) i s now denote the minimum chip height for the component list Ci, C, assuming the first fold is at s. As before fin, n) ....
E. Horowitz, and S. Sahni, "Fundamentals of Computer Algorithms", Computer Science Press, Maryland, 1978.
Vertex Splitting in Dags and Applications to Partial Scan.. - Paik, Reddy, Sahni (1990) (1 citation) Self-citation (Sahni) (Correct)
....tree in Figure 11. such that d (T W) d. Also, X = X z is such that d (T X) d and furthermore X is the answer produced by DVSP tree when started with T. Since the number of vertices in T is less than m 1, Hence, 5 A Backtracking Algorithm For DVSP Backtracking algorithms [HORO78] generally search a tree organization of the solution space using bounding functions. The solution to our problem is a 0 1 vector X = x 1 , x 2 , x n ) where n is the number of vertices and x i = 0 iff vertex i is not split. We use the binary tree organization used in [HORO78] for the ....
....[HORO78] generally search a tree organization of the solution space using bounding functions. The solution to our problem is a 0 1 vector X = x 1 , x 2 , x n ) where n is the number of vertices and x i = 0 iff vertex i is not split. We use the binary tree organization used in [HORO78] for the 0 1 knapsack problem. In this organization, the nodes at level i denote a decision on x i , 1 i n. If x i = 0 we move to the left subtree. Otherwise we move to the right subtree of a level i node. Figure 15 shows the solution space tree for the case n = 3. Each root to leaf path defines ....
E. Horowitz, and S. Sahni, "Fundamentals of Computer Algorithms", Computer Science Press, Maryland, 1978.
Histogramming on a Reconfigurable Mesh Computer - Jenq, Sahni (1992) (1 citation) Self-citation (Sahni) (Correct)
No context found.
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Inc., 1978.
Sorting Selection and Routing on the Array with.. - Rajasekaran, Sahni (5 citations) Self-citation (Sahni) (Correct)
....need 1oglogn) time, given only a polynomial number of processors. 13 4 Selection Given a sequence of n numbers k, k2, kn and an i n, the problem of selection is to identify the ith smallest of the n numbers. An elegant linear time sequential algorithm is known for selection (see e.g. [11]) Floyd and Rivest have given a simple linear time randomized algorithm for sequential selection [7] Optimal parallel algorithms are also known for selection on various models of computing (see e.g. 22] Most of the parallel selection algorithms (both deterministic and randomized) make use ....
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, 1978.
The Complexity of Design Automation Problems - Sahni, Bhatt, Raghavan (1980) (5 citations) Self-citation (Sahni) (Correct)
....time. The first problem that was shown to be related to the P = NP problem, in this way, was the problem of determining whether or not a propositional formula is satisfiable. This problem is referred to as the Satisfiability problem. Theorem 3.2: Satisfiability is in P iff P = NP. Proof: See [HORO78] or [GARE79] Let A and B be two problems. Problem A is polynomially reducible to problem B (abbreviated A reduces to B, and written as A a B) iff the existence of a deterministic polynomial time algorithm for B implies the existence of a deterministic polynomial time algorithm for A. Thus, if A ....
....most of the heuristic algorithms in use in the design automation area, little or no effort has been devoted to determining how good or bad (relative to the optimal solution values) these are. In what follows, we briefly review some results that concern design automation. The reader is referred to [HORO78, Chap 12] for a more complete discussion of heuristics for NP hard problems. For most NP hard problems, it is the case that the problem of finding absolute approximations is also NP hard. As an example, consider problem IP3 (circuit realization) Let c i x i be an instance of IP3. Consider the ....
[Article contains additional citation context not shown here]
Horowitz, E. and S.Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Potomac, MD, 1978.
Deleting Vertices to Bound Path Length - Paik, Reddy, Sahni Self-citation (Sahni) (Correct)
No context found.
E. Horowitz, and S. Sahni, "Fundamentals of Computer Algorithms", Computer Science Press, Maryland, 1978.
Sorting and Routing on the Array with Reconfigurable Optical.. - Rajasekaran, Sahni Self-citation (Sahni) (Correct)
No context found.
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, 1978. 18
Anomalies in Parallel Branch-and-Bound Algorithms - Lai, Sahni (1984) (45 citations) Self-citation (Sahni) (Correct)
....in the solution of problems that arise in various fields (e.g. combinatorial optimization, artificial intelligence, etc. 1, 9 15] We shall briefly describe the branch and bound method as used in the solution of combinatorial optimization problems. Our terminology is from Horowiz and Sahni [10]. In a combinatorial optimization problem we are required to find a vector x = x 1 , x 2 , x n ) that optimizes some criterion function f(x) subject to a set C of constraints. This constraint set may be partitioned into two subsets: explicit and implicit. Implicit constraints specify how ....
....algorithms by using several E nodes at each iteration. In this section we establish these anomalies under varying constraints for the bounding function g( First, it should be recalled that the g( functions typically used (e.g. for the knapsack problem, traveling salesperson problem, etc. cf. [10] ) in addition to satisfying properties P1 P4, satisfy the following property: P5. Several nodes in the state space tree may have the same g( value. In fact, many nonsolution nodes may have a g( value equal to f , the value of an optimal solution. This is particularly true of nodes that are ....
[Article contains additional citation context not shown here]
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Inc., 1978.
Complexity Theory and the No Free Lunch Theorem - Whitley, Watson (2005) (1 citation) (Correct)
No context found.
E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978.
On Network Survivability Algorithms based on Trellis.. - Louca, Pitsillides.. (1999) (Correct)
No context found.
Horowitz E., Sahni, S., "Fundamentals of Computer Algorithms", Computer Science Press, Inc., USA, 1978.
Iterative-Improvement-Based Declustering Heuristics For.. - Koyuturk, Aykanat (2005) (Correct)
No context found.
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Potomac, Maryland, 1978.
Encapsulating Multiple Communication-Cost Metrics in.. - Ucar, Aykanat (Correct)
No context found.
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, 1978.
Compositional Ecological Modelling via Dynamic Constraint.. - Keppens (Correct)
No context found.
Horowitz, E. and Sahni, S. Fundamentals of Computer Algorithms. Computer Science Press, Rockville, MD, 1978.
A System for Constructing Boundary Representation Solid.. - Varley, Martin (2000) (Correct)
No context found.
E.Horowitz and S.Sahni, Fundamentals of Computer Algorithms, Computer Science Press Inc, 1979.
Semi-Lazy Learning: Combining Clustering and Classifiers to.. - Davidson, Yin (2003) (Correct)
No context found.
Horowitz E. and Sahni S., Fundamentals of Computer Algorithms, Computer Science Press, Inc, 1978.
Functional Logic Design Patterns - Antoy, Hanus (2002) (1 citation) (Correct)
No context found.
E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978.
Functional Logic Design Patterns - Antoy, Hanus (2002) (1 citation) (Correct)
No context found.
E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978.
Using Procedural Parameters and Continuations in Combinatorial.. - Hwang (Correct)
No context found.
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, MD, 1978.
Software---Practice And Experience, Vol. 24(9).. - Optimized.. (Correct)
No context found.
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Rockville, Maryland, 1978.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC