๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minority influence and optimal problem solving

โœ Scribed by Robin Martin; Miles Hewstone


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
105 KB
Volume
29
Category
Article
ISSN
0046-2772

No coin nor oath required. For personal study only.

โœฆ Synopsis


An analogous thinking task was used to test Nemeth's ConvergentยฑDivergent theory of majority and minority inยฏuence. Participants read a (base) problem and one of three solutions (one of which is considered the best' solution). They then generated solutions to a second (target) problem which shared similar structural features to the ยฎrst problem. Due to the similarities between problems, the solution given to the ยฎrst problem can be used as an analogy in solving the second. In contrast to Nemeth's theory, when the solution to the base problem was endorsed by a numerical majority there was not an increase in analogy-transfer in solving the target problem. However, in support of Nemeth's theory, when the base solution was supported by a numerical minority then the participants were more likely to generate the best' solution to the target problem regardless of which base solution they were given.


๐Ÿ“œ SIMILAR VOLUMES


Can spreadsheet solvers solve demanding
โœ Eugรฉnio C. Ferreira; Romualdo Salcedo ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 184 KB

## Abstract Practicing engineers resort to modular simulators or to algebraic tools such as GAMS or AMPL for performing complex process optimizations. These tools, however, have a significant learning curve unless they have been introduced at the undergraduate level beforehand. In this work we show

Solving Steiner tree problems in graphs
โœ Koch, T.; Martin, A. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 261 KB ๐Ÿ‘ 2 views

In this paper, we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms, and primal heuristics. We are able to solve nea

Solving structural optimization problems
โœ Salvador Botello; Jose L. Marroquin; Eugenio Oรฑate; Johan Van Horebeek ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 142 KB ๐Ÿ‘ 2 views

In this paper we study the performance of two stochastic search methods: Genetic Algorithms and Simulated Annealing, applied to the optimization of pin-jointed steel bar structures. We show that it is possible to embed these two schemes into a single parametric family of algorithms, and that optimal

Neurosis and problem-solving behavior
โœ Norman S. Greenfield ๐Ÿ“‚ Article ๐Ÿ“… 1957 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 281 KB
MOSA method: a tool for solving multiobj
โœ E.L. Ulungu; J. Teghem; P.H. Fortemps; D. Tuyttens ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 189 KB ๐Ÿ‘ 2 views

The success of modern heuristics (Simulated Annealing (S.A.), Tabu Search, Genetic Algorithms, . . . ) in solving classical combinatorial optimization problems has drawn the attention of the research community in multicriteria methods. In fact, for large-scale problems, the simultaneous difficultie

Problem solving in science and technolog
โœ Derrick Lavoie ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 116 KB ๐Ÿ‘ 1 views

This issue of Science Education introduces the new section, "The Books," which signals the journal's interest in filling a need felt by its readership. Over the years, the Editorial Board has become concerned that the international field of science education has not been well served by the relativel