Now showing items 1-5 of 5
Fast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries
A non-iterative method and its application to planar geometries in homogeneous media is presented. The method is extendable to the cases of quasi-planar structures and/or layered-media problems. The fast direct algorithm ...
Solution of radiation problems using the fast multipole method
Electromagnetic radiation problems involving electrically large radiators and reflectors are solved using the fast multipole method (FMM). The FMM enables the solution of large problems with existing computational resources ...
An approximation algorithm for computing the visibility region of a point on a terrain and visibility testing
Given a terrain and a query point p on or above it, we want to count the number of triangles of terrain that are visible from p. We present an approximation algorithm to solve this problem. We implement the algorithm and ...
A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem
In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these ...
SIMARD: a simulated annealing based RNA design algorithm with quality pre-selection strategies
Most of the biological processes including expression levels of genes and translation of DNA to produce proteins within cells depend on RNA sequences, and the structure of the RNA plays vital role for its function. RNA ...