GP requires that all functions/terminals (tree labels) be given apriori. In the absence of specific information about the solution, the user is often forced to provide a large set, thus enlarging the search space — often resulting in reducing the search efficiency. Moreover, based on heuristics, syntactic constraints, or data typing, a given subtree may be undesired or invalid in a given contex...

Data mining has as goal to extract knowledge from large databases. To extract this knowledge, a database may be considered as a large search space, and a mining algorithm as a search strategy. In general, a search space consists of an enormous number of elements, making an exhaustive search infeasible. Therefore, efficient search strategies are of vital importance. Search strategies based on ge...

A b s t r a c t − A new code is presented which improves the minimum distance properties of sequence detectors operating at high linear densities. This code, which is called the maximum transition run code, eliminates data patterns producing three or more consecutive transitions while imposing the usual k-constraint necessary for timing recovery. The code possesses the similar distance-gaining ...

AI efforts to solve problems with computers which humans routinely handle by employing innate cognitive abilities, pattern recognition, perception and experience, invariably must turn to considerations of search. This Chapter explores search methods in AI, including both blind exhaustive methods and informed heuristic and optimal methods, along with some more recent findings. The search methods...

Instead of imposing the Schrödinger equation to obtain the configuration space propagator 〈x, t2|y, t1〉 for a quantum mechanical nonlinear sigma model, we directly evaluate the phase space propagator 〈x| exp (

a constitutive model based on two–dimensional unstructured galerkin finite volume method (gfvm) is introduced and applied for analyzing nonlinear behavior of cracked concrete structures in equilibrium condition. the developed iterative solver treats concrete as an orthotropic nonlinear material and considers the softening and hardening behavior of concrete under compression and tension by using...

in this paper, an iterative method is proposed for solving large general sylvester matrix equation $axb+cxd = e$, where $a in r^{ntimes n}$ , $c in r^{ntimes n}$ , $b in r^{stimes s}$ and  $d in r^{stimes s}$ are given matrices and $x in r^{stimes s}$  is the unknown matrix. we present a global conjugate gradient (gl-cg) algo- rithm for solving linear system of equations with multiple right-han...

Introduction: Beam-angle optimization (BAO) is a computationally intensive problem for a number of reasons. First, the search space of the solutions is huge, requiring enumeration of all possible beam orientation combinations. For example, when choosing 4 angles out of 36 candidate beam angles, C36 = 58905 possible combinations exist.  Second, any change in a   beam 4 config...