نتایج جستجو برای: search designs

تعداد نتایج: 361259  

2003
STEPHEN LEARY ATUL BHASKAR

 The use of optimal orthogonal array latin hypercube designs is proposed. Orthogonal arrays were proposed for constructing latin hypercube designs by Tang (1993). Such designs generally have better space filling properties than random latin hypercube designs. Even so, these designs do not necessarily fill the space particularly well. As a result, we consider orthogonal-array-based latin...

Journal: :Front. Robotics and AI 2015
Michal Joachimczak Reiji Suzuki Takaya Arita

Novelty search is an evolutionary search algorithm based on the superficially contradictory idea that abandoning goal-focused fitness function altogether can lead to the discovery of higher fitness solutions. In the course of our work, we have created a biologically inspired artificial development system with the purpose of automatically designing complex morphologies and controllers of multice...

2012
C. J. Brien R. A. Bailey T. T. Tran

This paper gives a general method for constructing quasi-Latin square, quasi-Latin 12 rectangle and extended quasi-Latin rectangle designs for symmetric factorial experiments. Two 13 further methods are given for parameter values satisfying certain conditions. Designs are 14 constructed for a range of numbers of rows and columns so that the different construction 15 techniques are illustrated. ...

2015
Jie Yang Abhyuday Mandal Dibyen Majumdar JIE YANG DIBYEN MAJUMDAR

We consider the problem of obtaining D-optimal designs for factorial experiments with a binary response and k qualitative factors each at two levels. We obtain a characterization of locally D-optimal designs. We then develop efficient numerical techniques to search for locally D-optimal designs. Using prior distributions on the parameters, we investigate EW D-optimal designs that maximize the d...

2003
Luis B. Morales

Some papers have dealt with the construction of 2-concurrence designs as an optimization problem. In this paper we generalize these results to formulate also the construction of partially balanced incomplete block designs with 2 associate classes as a combinatorial optimization problem. We will propose an algorithm based on tabu search to construct many of these designs. Our algorithm was able ...

2004
Andrew Gould

I present an Hipparcos color-magnitude diagram (CMD) that is color-coded by transverse velocity v ⊥. This illustrates the connection between the photomet-ric and kinematic properties of various stellar populations in a manner that is particularly suitable to introductory astronomy courses.

2007
Thanyapat Sakunkonchak Takeshi Matsumoto Hiroshi Saito Satoshi Komatsu Masahiro Fujita

In system-level designs, since many incremental refinements are applied to the designs, equivalence checking between each refinement should be applied. However, proving whether two concurrent designs are equivalent is a difficult task, not to mention that the concurrent design itself can be error-prone. In this paper, we propose an equivalence checking method for C-based descriptions of systeml...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید