نتایج جستجو برای: searching methods

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

Journal: :JCP 2012
Shu-ping Yang Xiu-gui Yuan Zai-ming Liu

In the paper, aimed at the shortcoming of trust region method, we proposed a algorithm using negative curvature direction as its searching direction. The convergence of the algorithm was given. Furthermore, combing trust region method and curve-linear searching techniques, a trust region algorithm, using general curvelinear searching direction, was proposed. We proved its efficiency and feasibi...

2002
Bryan Pardo William P. Birmingham

This paper examines the standard string-matching approach to automated score following of an acoustic performance, looking at limitations imposed by both the score representation used and the matching approach. The approach is then extended through the incorporation of duration information and matchscores based on a model of transcriber error. The resulting score follower promises to allow comp...

2009
Orgad Keller Tsvi Kopelowitz Shir Landau Feibish Moshe Lewenstein

In substring compression one is given a text to preprocess so that, upon request, a compressed substring is returned. Generalized substring compression is the same with the following twist. The queries contain an additional context substring (or a collection of context substrings) and the answers are the substring in compressed format, where the context substring is used to make the compression...

2013
Zhewei Wei Ke Yi

We study the problem of 2-dimensional orthogonal range counting with additive error. Given a set P of n points drawn from an n× n grid and an error parameter ε, the goal is to build a data structure, such that for any orthogonal range R, the data structure can return the number of points in P ∩ R with additive error εn. A well-known solution for this problem is the εapproximation. Informally sp...

Journal: :SIAM J. Comput. 2006
Christian Worm Mortensen

2012
Yakov Nekrich Gonzalo Navarro

We consider a variant of the orthogonal range reporting problem when all points should be reported in the sorted order of their x-coordinates. We show that reporting two-dimensional points with this additional condition can be organized (almost) as efficiently as the standard range reporting. Moreover, our results generalize and improve the previously known results for the orthogonal range succ...

Journal: :نامه انجمن حشره شناسی ایران 0
r. hosseini a. a. sahragard kh. madahi

searching efficiency (a') (attack rate) and handling time are two major components of natural enemies’ functional response and are usually used to evaluate their effectiveness. the age-specific searching efficiency of aphidoletes aphidimyza (rondani) was studied during its larval stage. the experiment was conducted in terms of age-specific functional response to the varying density (5, 1...

2005
Markian Hlynka Jonathan Schaeffer

This paper introduces the idea of pre-searching a position—searching it before αβ determines that it needs to be searched. Consider the case where an iteration of αβ search comes across a position p that needs to be searched to depth d1, and the transposition table reveals that p will likely need to be searched later in that iteration to depth d2 greater than d1. Pre-searching involves speculat...

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

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