AI has been successful in producing expert systems for diagnosis, qualitative simulation, configuration and tutoring-e.g. classification problem solving. It has been less successful in producing expert systems that design artifacts, including computer programs. Deductive synthesis of a design from first principles is combinatorially explosive, yet libraries of design schemas do not have suffici...

Analog synthesis tools have traditionally traded quality for speed, substituting simplified circuit evaluation methods for full simulation in order to accelerate the numerical search for solution candidates. In this paper we develop a new numerical search algorithm efficient enough to allow full circuit simulation of each circuit candidate, and robust enough to find good solutions for difficult...

If a Steiner system S(4, 5, 17) exists, it would contain derived S(3, 4, 16) designs. By relying on a recent classification of the S(3, 4, 16), an exhaustive computer search for S(4, 5, 17) is carried out. The search shows that no S(4, 5, 17) exists, thereby ruling out the existence of Steiner systems S(t, t+ 1, t+ 13) for t ≥ 4.

Efficient search is an active topic in peer-to-peer networks. To date most of the work in this area has been oriented towards devising new algorithms. However, little has been done to understand the fundamental similarities and differences between the wide variety of proposed designs. Such an understanding would be invaluable for the architects of future decentralized systems. In order to stimu...

Section A describes the least-squares method used to calculate the LUTE matrix. Section B describes what terms need to be included in the energy matrix. Each term corresponds to a tuple of RCs at di↵erent positions. Section C describes how a pruning interval, a parameter used for pruning in continuously flexible designs, can be computed for several types of LUTE calculations. Section D provides...

In computer-aided biological design, the trifecta of characterized part libraries, accurate models and optimal design parameters is crucial for producing reliable designs. As the number of parts and model complexity increase, however, it becomes exponentially more difficult for any optimization method to search the solution space, hence creating a trade-off that hampers efficient design. To add...

This paper describes ongoing work into a model of computational design that is based on curiosity. The model uses goal reformulation to pursue specific unexpected stimuli in order to generate new designs that are creative (i.e. novel and valuable). The model combines a number of techniques from AI, including goal reasoning, heuristic search, genetic algorithms and case-based reasoning, with a d...

This paper presents an optimization methodology that includes three important components necessary for a systematic approach to naval ship concept design. These are: • An efficient and effective search of design space for non-dominated designs • Well-defined and quantitative measures of objective attributes • An effective format to describe the design space and to present non-dominated concepts...

This paper addresses the problem of optimizing a factorial system with multiple responses. A heuristic termed probabilistic sequential methodology (PSM) is proposed. The PSMidenti® es those designs that maximize the likelihood of satisfying a given set of functional requirements. It is based on sequential experimentation, statistical inference and a probabilistic local search. The PSM comprises...

This paper suggests an improvement to the scheme by Bayer and Metzger for the encipherment of BTmes. Search keys are “disguised” instead of encrypted, and together with the data pointers and tree pointers which remain encrypted, prevents the opponent or attacker from recreating the correct shape of the B-Tree. Combinatorial block designs are used as a method to substitute the search keys contai...