Sökning: "search heuristics"
Visar resultat 1 - 5 av 28 avhandlingar innehållade orden search heuristics.
1. Admissible Heuristics for Automated Planning
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
2. Scheduling of embedded real-time systems : a constraint programming approach
Sammanfattning : .... LÄS MER
3. In Search of Prototypes and Feminist Bank-Tellers: Exploring the Representativeness Heuristic
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
4. Understanding the provision and processing of information for information-intensive products as a basis for market segmentation
Sammanfattning : 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. LÄS MER
5. Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem
Sammanfattning : 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. LÄS MER