The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper a novel model based on electromagnetism-like mechanism (EM) is proposed which is highly compatible with discrete space problems. The proposed method utilizes the EM operators to move particles towards an optimal or near optimal solutions. In fact, the proposed algorithm exploits the crossover operator to calculate forces on particles and move them according to these forces. To keep the...
Evolutionary optimization of expensive functions typically uses a metamodel, i.e. a computationally cheaper but inaccurate approximation of the objective function. The success of the optimization search depends on the accuracy of the metamodel hence an integral part of the metamodelling framework is assessing the metamodel accuracy. In this paper we survey a range of accuracy assessment methods such...
Liver segmentation on computed tomography (CT) images is a challenging task due to the anatomic complexity and the imaging system noise. In this paper, we develop an improved level set segmentation method. Our region-based level-set approach has many advantages over the conventional active contour models. First, the improved model can get much smoother contour by adding a signed distance preserving...
Search-based test data generation has been a considerably active research field recently. Several local and global search approaches have been proposed, but the investigation of artificial immune system (AIS) algorithms has been extremely limited. Our earlier results from testing six Java classes, exploiting a genetic algorithm (GA) to measure data- flow coverage, helped us identify a number of problematic...
We establish new lower bounds on the complexity of several searching problems. We show that the time for solving the partial sum problem on n points in d dimensions is at least proportional to (log n/log 2m/n)d-1 in both the worst and average cases; m denotes the amount of storage used. This bound is provably tight for m = Ω(nlogcn) and any c ≫ d- 1. We also prove a lower bound of Ω(n(log n/log log...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.