نتایج جستجو برای: scatter searching algorithm

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

2003
Yuriy Rashkevych Dmytro Peleshko Mykola Pasyeka

There are proposed method of acceleration of large string search in database of learning management system.

2003
Veli Mäkinen Gonzalo Navarro Esko Ukkonen

2008
Maxime Crochemore Thierry Lecroq

2003
Katrina D. Edgar David M. Nichols Gordon W. Paynter Kirsten Thomson Ian H. Witten

Phrase browsing interfaces based on hierarchies of phrases extracted automatically from document collections offer a useful compromise between automatic full-text searching and manually-created subject indexes. The literature contains descriptions of such systems that many find compelling and persuasive. However, evaluation studies have either been anecdotal, or focused on objective measures of...

2011

In this article a numerical MATLAB algorithm is presented to visualize the workspace of serial and parallel kinematics. For serial kinematics the Monte Carlo Method is used to convert the inputted DH-Parameters to a scatter plot of the reachable workspace. The article gives also a detailed insight into the processing of these scatter plot to find and visualize the boundary points of the workspa...

2011
John Yi-Wu Chiang Ying-Ching Chen Yung-fu Chen

Underwater environments often cause color scatter and color cast during photography. Color scatter is caused by haze effects occurring when light reflected from objects is absorbed or scattered multiple times by particles in the water. This in turn lowers the visibility and contrast of the image. Color cast is caused by the varying attenuation of light in different wavelengths, rendering underw...

2008
Maxime Crochemore Thierry Lecroq

2013
Khin Lwin Rong Qu Jianhua Zheng

The relevant literature showed that many heuristic techniques have been investigated for constrained portfolio optimization problem but none of these studies presents multi-objective Scatter Search approach. In this work, we present a hybrid multi-objective population-based evolutionary algorithm based on Scatter Search with an external archive to solve the constrained portfolio selection probl...

1997
Thierry Lecroq

The Apostolico-Giancarlo string-matching algorithm is analyzed precisely. We give a tight upper bound of 3 2 n text character comparisons when searching for a pattern in a text of length n. We exhibit a family of patterns and texts reaching this bound. We also provide a slightly improved version of the algorithm.

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

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