NotesFAQContact Us
Search Tips
Laws, Policies, & Programs
What Works Clearinghouse Rating
Showing 76 to 79 of 79 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Pizlo, Zygmunt; Stefanov, Emil; Saalweachter, John; Li, Zheng; Haxhimusa, Yll; Kropatsch, Walter G. – Journal of Problem Solving, 2006
We tested human performance on the Euclidean Traveling Salesman Problem using problems with 6-50 cities. Results confirmed our earlier findings that: (a) the time of solving a problem is proportional to the number of cities, and (b) the solution error grows very slowly with the number of cities. We formulated a new version of a pyramid model. The…
Descriptors: Problem Solving, Models, Mathematics, Visual Perception
Peer reviewed Peer reviewed
Direct linkDirect link
Burns, Nicholas R.; Lee, Michael D.; Vickers, Douglas – Journal of Problem Solving, 2006
Studies of human problem solving have traditionally used deterministic tasks that require the execution of a systematic series of steps to reach a rational and optimal solution. Most real-world problems, however, are characterized by uncertainty, the need to consider an enormous number of variables and possible courses of action at each stage in…
Descriptors: Individual Differences, Performance, Problem Solving, Intelligence
Peer reviewed Peer reviewed
Direct linkDirect link
van Rooij, Iris; Schactman, Alissa; Kadlec, Helena; Stege, Ulrike – Journal of Problem Solving, 2006
The Euclidean Traveling Salesperson Problem (E-TSP) is a useful task to study how humans optimize when faced with computational intractability. It has been found that humans are capable of finding high-quality solutions for E-TSP in a relatively short time and with seemingly little cognitive effort. This observation has led to two general…
Descriptors: Problem Solving, Cognitive Processes, Children, Adults
Peer reviewed Peer reviewed
Direct linkDirect link
Chronicle, Edward; MacGregor, James; Ormerod, Thomas – Journal of Problem Solving, 2006
The two-dimensional Traveling Salesperson Problem (TSP) requires finding the shortest tour through n locations. Untrained adults are adept at the task and reliably outperform simple construction algorithms for n= 60. Performance may stem from a specific inherent ability. Alternatively, it may reflect general spatial intelligence, whether inherent…
Descriptors: Problem Solving, Performance, Cognitive Ability, Comparative Analysis
« Previous Page | Next Page
Pages: 1  |  2  |  3  |  4  |  5  |  6