• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 499
  • 267
  • 56
  • 52
  • 47
  • 16
  • 8
  • 6
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • 4
  • Tagged with
  • 1139
  • 264
  • 219
  • 189
  • 153
  • 148
  • 147
  • 144
  • 127
  • 113
  • 111
  • 104
  • 92
  • 81
  • 79
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Heuristische Elemente der Kritik der teleologischen Urteilskraft

Karja, Harald. January 1975 (has links)
Thesis (doctoral)--Ruprecht-Karl-Universität, Heidelberg, 1975. / Includes vita. Includes bibliographical references (p. [115]-125).
2

Heuristische Elemente der Kritik der teleologischen Urteilskraft

Karja, Harald. January 1975 (has links)
Thesis (doctoral)--Ruprecht-Karl-Universität, Heidelberg, 1975. / Includes vita. Includes bibliographical references (p. [115]-125).
3

Die didaktiese betekenis van die heuristiek

15 September 2015 (has links)
M.Ed. / Please refer to full text to view abstract
4

Limitations of and extensions to heuristic search planning

Burfoot, Daniel. January 2006 (has links)
No description available.
5

Limitations of and extensions to heuristic search planning

Burfoot, Daniel. January 2006 (has links)
This thesis explores limitations of heuristic search planning, and presents techniques to overcome those limitations. The two halves of the thesis discuss problems in standard propositional planning (STRIPS) and in planning with numeric state variables respectively. / In the context of STRIPS, the primary focus is on the widely used relaxed plan heuristic (h+). A variety of cases are shown in which h+ provides systematically bad estimates of goal distance. To address this breakdown, a planning system called RRT-Plan is presented. This system is inspired by the concept of Rapidly-exploring Random Trees, which was originally developed for use in mobile robot path planning. Experimental results show that RRT-Plan is comparable to leading planners in terms of number of problems solved and plan quality. We conclude that the effectiveness of RRT-Plan is based on its ability to search the space of artificial goal orderings. / The second half of the work considers heuristic search planning in numeric domains. Two particularly significant obstacles are identified. The Curse of Affluence is due to the vast blowup in the search space caused by the addition of numeric variables. The Curse of Poverty relates to the difficulty of finding relevant lower bounds on resource consumption. / Exploration of the Curse of Affluence leads to the new concepts of reduced search and enhanced states. In reduced search, certain simple operators are not used to expand states. Instead, enhanced states are constructed which represent all possible states which could be achieved by suitably inserting simple operators in the plan. Enhanced states are represented by a set of constant discrete variables, and a convex hull of numeric values. This representation can be queried and updated in a natural way. Experimental results show that there are domains for which reduced search gives order of magnitude performance improvements over Metric-FF, a leading heuristic search planner for numeric domains.
6

An experimental investigation of some heuristics for scheduling resource-constrained projects / by Dale F. Cooper

Cooper, Dale Francis January 1974 (has links)
ix, 295 leaves : tables ; 25 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.1975) from the Dept. of Computing Science, University of Adelaide
7

An experimental investigation of some heuristics for scheduling resource-constrained projects /

Cooper, Dale Francis. January 1974 (has links) (PDF)
Thesis (Ph.D. 1975) from the Department of Computing Science, University of Adelaide.
8

Handling worst case in skyline /

Jain, Romil. January 2009 (has links)
Thesis (M.Sc.)--York University, 2009. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 83-84). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR51543
9

Gender based meta-heuristic optimization algorithms

Tian, Zhong Huan January 2017 (has links)
University of Macau / Faculty of Science and Technology / Department of Computer and Information Science
10

Constructive and ant system heuristics for a class of vehicle routing problem with backhauls

Wade, Anne Camilla January 2002 (has links)
No description available.

Page generated in 0.0739 seconds