An algorithm for test set generation of combinational circuits.

Date

1983

Author

Halıcı, Uğur

Metadata

Show full item record

Item Usage Stats

103
views

0
downloads

URI

https://hdl.handle.net/11511/6871

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

An algorithm for multiscale license plate detection and rule-based character segmentation Karalı, Ali Onur; Ulusoy, İlkay; Department of Electrical and Electronics Engineering (2011) License plate recognition (LPR) technology has great importance for the development of Intelligent Transportation Systems by automatically identifying the vehicles using image processing and pattern recognition techniques. Conventional LPR systems consist of license plate detection (LPD), character segmentation (CS) and character recognition (CR) steps. Successful detection of license plate and character locations have vital role for proper LPR. Most LPD and CS techniques in the literature assume fixed dist...
An Evolutionary Algorithm for Finding Efficient Solutions in Multi-Attribute Auctions Koksalan, Murat; Karakaya, Gülşah (2014-05-01) There is a growing interest in electronic auctions. Many researchers consider a single-attribute, although auctions are multi-attribute in nature in practice. Addressing multiple attributes increases the difficulty of the problem substantially. We develop an evolutionary algorithm (EA) for multi-attribute multi-item reverse auctions. We try to generate the whole Pareto front using the EA. We also develop heuristic procedures to find several good initial solutions and insert those in the initial population o...
An interactive approximation algorithm for multi-objective integer programs Lokman, Banu; Korhonen, Pekka J.; Wallenius, Jyrki (2018-08-01) We develop an interactive algorithm that approximates the most preferred solution for any multi-objective integer program with a desired level of accuracy, provided that the decision maker's (DM's) preferences are consistent with a nondecreasing quasiconcave value function. Using pairwise comparisons of the DM, we construct convex cones and eliminate the inferior regions that are close to being dominated by the cones in addition to the regions dominated by the cones. The algorithm allows the DM to change th...
An evolutionary algorithm for multiple criteria problems Soylu, Banu; Köksalan, Murat; Department of Industrial Engineering (2007) In this thesis, we develop an evolutionary algorithm for approximating the Pareto frontier of multi-objective continuous and combinatorial optimization problems. The algorithm tries to evolve the population of solutions towards the Pareto frontier and distribute it over the frontier in order to maintain a well-spread representation. The fitness score of each solution is computed with a Tchebycheff distance function and non-dominating sorting approach. Each solution chooses its own favorable weights accordin...
An Evolutionary Genetic Algorithm for Optimization of Distributed Database Queries Sevinc, Ender; Coşar, Ahmet (2011-05-01) High-performance low-cost PC hardware and high-speed LAN/WAN technologies make distributed database (DDB) systems an attractive research area where query optimization and DDB design are the two important and related problems. Since dynamic programming is not feasible for optimizing queries in a DDB, we propose a new genetic algorithm (GA)-based query optimizer (new genetic algorithm (NGA)) and compare its performance with random and optimal (exhaustive) algorithms. We perform experiments on a synthetic data...

Citation Formats

U. Halıcı, “An algorithm for test set generation of combinational circuits.,” Middle East Technical University, 1983.