Search termination when the target is absent: The prevalence of coarse processing and its intertrial influence.

Jieun Cho; Sang Chul Chong

doi:10.1037/xhp0000686

Search termination when the target is absent: The prevalence of coarse processing and its intertrial influence.

Journal of Experimental Psychology Human Perception & Performance ◽

10.1037/xhp0000686 ◽

2019 ◽

Vol 45 (11) ◽

pp. 1455-1469

Author(s):

Jieun Cho ◽

Sang Chul Chong

Keyword(s):

Search Termination

Download Full-text

A Note on Line Search Termination Criteria for Collinear Scaling Algorithms

Computing ◽

10.1007/s00607-002-1466-9 ◽

2003 ◽

Vol 70 (1) ◽

pp. 25-39 ◽

Cited By ~ 1

Author(s):

K. A. Ariyawansa ◽

Wayne L. Tabor

Keyword(s):

Line Search ◽

Termination Criteria ◽

Search Termination ◽

On Line ◽

Scaling Algorithms

Download Full-text

A Dynamic Search Termination Scheme for Retail Labour Scheduling Problems

OR Insight ◽

10.1057/ori.2008.15 ◽

2008 ◽

Vol 21 (4) ◽

pp. 3-9

Author(s):

Vinh Quan* ◽

Xianjie Shi

Keyword(s):

Scheduling Problems ◽

Dynamic Search ◽

Search Termination ◽

Labour Scheduling

Download Full-text

A rational approach to memory search termination

Cognitive Systems Research ◽

10.1016/j.cogsys.2012.12.012 ◽

2013 ◽

Vol 24 ◽

pp. 96-103 ◽

Cited By ~ 3

Author(s):

Eddy J. Davelaar ◽

Erica C. Yu ◽

J. Isaiah Harbison ◽

Erika K. Hussey ◽

Michael R. Dougherty

Keyword(s):

Memory Search ◽

Rational Approach ◽

Search Termination

Download Full-text

An Improved Direct Search Mathematical Programming Algorithm

Journal of Engineering for Industry ◽

10.1115/1.3438753 ◽

1975 ◽

Vol 97 (4) ◽

pp. 1305-1310 ◽

Cited By ~ 7

Author(s):

M. Pappas ◽

J. Y. Moradi

Keyword(s):

Mathematical Programming ◽

Direction Finding ◽

Direct Search ◽

Pattern Search ◽

New Method ◽

Programming Algorithm ◽

Test Problems ◽

Feasible Direction ◽

Search Termination

An improved, nonlinear, constrained algorithm is presented, coupling a rotating coordinate pattern search with a feasible direction finding procedure used at points of pattern search termination. The procedure is compared with eighteen algorithms, including most of the popular methods, on ten test problems. These problems are such that the majority of codes failed to solve more than half of them. The new method proved superior to all others in the overall generality and efficiency rating, being the only one solving all problems.

Download Full-text