Sökning: "heuristic search"

Visar resultat 1 - 5 av 55 avhandlingar innehållade orden heuristic search.

  1. 1. In Search of Prototypes and Feminist Bank-Tellers: Exploring the Representativeness Heuristic

    Författare :Håkan Nilsson; Peter Juslin; Karl Halvor Teigen; Uppsala universitet; []
    Nyckelord :Psychology; Cognitive psychology; Subjective probability; Representativeness heuristic; PROBEX; Category learning; Cognitive modeling; Conjunction fallacy; Psykologi;

    Sammanfattning : 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. LÄS MER

  3. 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

    Författare :Poja Shams; Anders Gustafsson; Erik Wästlund; Martin Löfgren; A. Parasuraman; Karlstads universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; point-of-purchase marketing; influencing factors; out-of-store; in-store; shelf space; product packaging; package design; visual attention; visual search; eye-tracking; process-tracing; gaze cascade model; recognition heuristic; familiarity; decision-making; decision-making process; decision-making strategies; heuristic decision-making; preference formation; information processing; Business Administration; Företagsekonomi;

    Sammanfattning : 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. LÄS MER

  4. 3. Admissible Heuristics for Automated Planning

    Författare :Patrik Haslum; Patrick Doherty; Derek Long; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; AI planning; optimal planning; temporal planning; heuristic search; Computer science; Datalogi;

    Sammanfattning : 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. LÄS MER

  5. 4. Parallel algorithms for solving the train timetable rescheduling problem

    Författare :Sai Prashanth Josyula; Johanna Törnquist Krasemann; Lars Lundberg; Blekinge Tekniska Högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Parallel computing; Parallel heuristic search algorithms; Computer Science; Datavetenskap;

    Sammanfattning : 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. LÄS MER

  7. 5. Optimization of Joint Cell, Channel and Power Allocation in Wireless Communication Networks

    Författare :Mikael Fallgren; Anders Forsgren; Zhi-Quan (Tom) Luo; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Wireless multicell networks; Optimization; OFDMA; Shannon capacity; Complexity; NP-hard; Relays; Allocation problems; Heuristic algorithms;

    Sammanfattning : 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. LÄS MER