Visual search light model for mental problem solving
نویسندگان
چکیده
This paper proposes a model of mental imagery which takes into account the role of internal attentional search light. We model the process of mental imagery problem solving by a long term memory which manipulates, with the aid of associations, the information of the visual buffer. The visual buffer is changed until a desired solution for a visual problem is achieved. The associations are determined in the retrieval phase of the long term memory. No variable binding mechanism is used. Instead, the search light model is applied to determine, which associations can be executed. The behavior of the model is demonstrated by empirical experiments in geometric block world. r 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملSearching for student intermediate mental steps
This paper presents a general method for identifying student intermediate mental steps from sequences of actions stored by problem solving-based learning environments, in order to provide feedback to teachers on knowledge that statistically seems to be used by a particular student. When many intermediate mental steps are possible, ambiguity is removed using what is already known about the stude...
متن کاملA multi-product, multi-period model to select supplier for deteriorating products while considering uncertainty as well as backorder
Determining supplier and optimum order of the quantity is an issue of great importance in logistics management for many companies. In this regard, it is crucial to determine the best decisions for the order quantity as well as the most suitable supplier through considering existing limitations and uncertainties. To optimize a multi-product, multi-period model with select supplier for deteriorat...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملSolving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Neurocomputing
دوره 71 شماره
صفحات -
تاریخ انتشار 2008