Search for dissertations about: "search heuristics"

Showing result 1 - 5 of 28 swedish dissertations containing the words search heuristics.

  2. 1. Admissible Heuristics for Automated Planning

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

    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. 2. Scheduling of embedded real-time systems : a constraint programming approach

    Author : Cecilia Ekelin; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; search heuristics; system modeling; optimization; complexity reduction; real-time systems; complex constraints; task allocation and scheduling; constraint programming;

    Abstract : .... READ MORE

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

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

    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

  6. 4. Understanding the provision and processing of information for information-intensive products as a basis for market segmentation

    Author : Daniel Edward Hall; Terrence Brown; Leyland Pitt; Jan Kietzmann; KTH; []
    Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Information-intensive products; consumer information search; consumer information processing; marketing strategy; wine marketing; Industriell ekonomi och organisation; Industrial Engineering and Management;

    Abstract : This thesis helps to address the gap in literature relating to the study of the provision of information to consumers, consumer information search behaviour and consumer information processing and choice behaviour relating to information-intensive products. Throughout the thesis, wine is taken as an example of an information-intensive product. READ MORE

  7. 5. Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem

    Author : Raad Salman; Göteborgs universitet; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; PCGmTSP; GTSP; SOP; mTSP; branch and bound; asymmetric generalized multiple traveling salesman problem; VRP; PCGTSP; dynamic programming; sequential ordering problem; vehicle routing problem; ant colony optimization; metaheuristic local search heuristic; precedence constraints; edge exchange; ant colony optimization;

    Abstract : In the planning phases of automated manufacturing, generating efficient programs for robot stations is a crucial problem which needs to be solved. One aspect of the programming is the optimization of task sequences, such as series of welds or measuring points, so that the cycle time is minimized. READ MORE