نتایج جستجو برای: closest target
تعداد نتایج: 413502 فیلتر نتایج به سال:
the present study is an experimental case study which investigates the impacts, if any, of skopos on syntactic features of the target text. two test groups each consisting of 10 ma students translated a set of sentences selected from advertising texts in the operative and informative mode. the resulting target texts were then statistically analyzed in terms of the number of words, phrases, si...
In this paper, an optimal stable algorithm is presented for members of a robots swarm moving toward a target. Equations of motion of the swarm are based on Lagrangian energy equations. Regarding of similar research On the design of swarm motion algorithm, an equation of motion considered constraints to guarantee no collision between the members and the members and obstacles along the motion pat...
The Closest Vector Problem (CVP) is a computational problem on lattices closely related to SVP. (See Shortest Vector Problem.) Given a lattice L and a target point ~x, CVP asks to find the lattice point closest to the target. As for SVP, CVP can be defined with respect to any norm, but the Euclidean norm is the most common (see the entry lattice for a definition). A more relaxed version of the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید