Counterintuitiveness in Folktales: Finding the Cognitive Optimum
نویسندگان
چکیده
منابع مشابه
An investigation into finding the optimum combination for dental restorations
The aim of the study was to find the optimum combination of materials and thicknesses to provide a tough, damage resistant multi-layer system with numerical methods to restore the damaged teeth. Extended Finite Element Method (XFEM) was used to assess the critical loads for the onset of damage modes such as radial cracks and plastic deformation in dental prostheses, which consist of a brittle o...
متن کاملFinding optimum branchings
Chu and Liu, Ecbnonds, and Bock have independently devised an ef f ic ient aZgorYithm to f i n d an optimum branching i n a d i rected haph. runs i n O(m2ogn) time i f the problem graph has n vertices and m edges. A modification for dense graphs gives a running time 2 of O(n 1. We also show that the unmodified algorithm runs i n 2 O(n(Zog n) + m) time on an average graph, asswning a uniform pro...
متن کاملOn finding optimum paths in computer networks
1 Supported in part by a grant from the Texas Advanced Research Program. Abstract-We consider the problem of finding an optimum path from each node in the network to a destination node in the network. Typically, each edge in the network is assigned a weight value (e.g. bandwidth or delay), and a metric function (e.g. min or +) is applied consecutively to the edges in the path. The result is the...
متن کاملA note on finding optimum branchings
The subject of t h i s note i s Tarjan's aZgorithm for finding an optimum branching in a directed graph. ed out, namely (i) an incorrect cZaim invoZving branching uniqueness, and (ii) an imprecise way of updating edge vaZues i n each i terat ion. val idi ty of the algorithm. I t is s h m here that they may be f ixed v i a a simpZe modification, which Zeaves unchanged the overall time and space ...
متن کاملFinding Optimum Wavefront of Parallel Computation
Data parallelism, in which the same operation is performed on many elements of an n-dimensional array, is one of the most powerful methods of extracting parallelism in scientific computation. One form of data parallelism involves defining a sequence of parallel wavefronts of a computation. Each wavefront consists of an (n− 1)-dimensional subarray of the evaluated array and all wavefront element...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cognition and Culture
سال: 2009
ISSN: 1567-7095,1568-5373
DOI: 10.1163/156770909x12489459066345