A new method to design wavelet networks using genetic algorithms is proposed. Designing wavelet networks is regarded as a combinatorial optimization problem to arrange the windows of wavelets and then genetic algorithms are used to derive their optimal arrangement. The effectiveness of the proposed method is verified through computer experiments.

We describe an experiment that generates squeezed states by means of forward four-wave mixing in sodium vapor with a single optical beam. The single-beam arrangement maximizes the pump-probe spatial overlap in the nonlinear medium. Self-focusing (or self-defocusing) is found to be the major limiting factor in achieving optimal squeezing.

Twin-row ridge cultivation is widely used in soybean planting northern China. In order to find the optimal parameters of agronomy, twin-row planter with subsoiling was designed. Field experiments were conducted evaluate effects plant arrangements and cluster densities on growth grain yield under different tillage treatments. The experiment a randomised complete block design consisting 20 treatm...

Warehousing management is essential for many companies involved in the supply chain. The optimal arrangement and operation of warehouses play important role companies, allowing them to maintain increase their competitiveness. One main goals warehousing reduction costs improvement efficiency.

The approach to solving cooperative-path finding (CPF) as satisfiability (SAT) is revisited. An alternative encoding that exploits multi-valued state variables representing locations where a given agent resides is suggested. This encoding employs the ALL-DIFFERENT constraint to model the requirement that agents must not collide with each other. We show that our new domain-dependent encoding ena...

this article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. regarding the np-hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. a number of test problems are randomly generat...

The approach to solving cooperative-path finding (CPF) as satisfiability (SAT) is revisited. An alternative encoding that exploits multi-valued state variables representing locations where a given agent resides is suggested. This encoding employs the ALL-DIFFERENT constraint to model the requirement that agents must not collide with each other. We show that our new domain-dependent encoding ena...

Divide-and-conquer approximation algorithms for vertex ordering problems partition the vertex set of graphs, compute recursively an ordering of each part, and “glue” the orderings of the parts together. The computed ordering is specified by a decomposition tree that describes the recursive partitioning of the subproblems. At each internal node of the decomposition tree, there is a degree of fre...