Search for dissertations about: "heuristic search"
Showing result 1 - 5 of 55 swedish dissertations containing the words heuristic search.
-
1. In Search of Prototypes and Feminist Bank-Tellers: Exploring the Representativeness Heuristic
Abstract : According to the heuristics and biases approach, the representativeness heuristic (RH) is one of the heuristics available for assessing subjective probabilities (A. Tversky & D. Kahneman, 1974). A subjective probability assessed by the RH is determined by how representative the target object is of the target category. READ MORE
-
2. What Does it Take to Get your Attention? : The influence of In-Store and Out-of-Store Factors on Visual Attention and Decision Making for Fast-moving Consumer Goods
Abstract : Decision making for fast-moving consumer goods involves a choice between numerous similar alternatives. Under such demanding circumstances, a decision is made for one product. The decision is dependent on the interaction between the environment and the mind of the consumer, both of which are filled with information that can influence the outcome. READ MORE
-
3. Admissible Heuristics for Automated Planning
Abstract : The problem of domain-independent automated planning has been a topic of research in Artificial Intelligence since the very beginnings of the field. Due to the desire not to rely on vast quantities of problem specific knowledge, the most widely adopted approach to automated planning is search. READ MORE
-
4. Parallel algorithms for solving the train timetable rescheduling problem
Abstract : In railways, it is essential to achieve high train punctuality. Thus, whenever disturbances occur, it is important to reschedule the trains effectively. This task is typically handled manually by traffic controllers in real-time. READ MORE
-
5. Optimization of Joint Cell, Channel and Power Allocation in Wireless Communication Networks
Abstract : In this thesis we formulate joint cell, channel and power allocation problems within wireless communication networks. The objectives are to maximize the user with mini- mum data throughput (Shannon capacity) or to maximize the total system throughput, referred to as the max-min and max-sum problem respectively. READ MORE