• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 92
  • 36
  • 8
  • 5
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 158
  • 158
  • 43
  • 37
  • 37
  • 32
  • 29
  • 28
  • 27
  • 25
  • 19
  • 19
  • 18
  • 17
  • 16
  • 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.

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.

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

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.

Limitations of and extensions to heuristic search planning

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

Scheduling problems with no intermediate storage : heuristics and probabilistic analysis

Nagorka, Peter Randal 08 1900 (has links)
No description available.

Heuristic workforce scheduling

Culver, William Daniel 12 1900 (has links)
No description available.

Optimizing steering heuristics for clustered microarchitectures

LaDuca, Robert James. January 2006 (has links)
Thesis (M.S.)--State University of New York at Binghamton, Watson School of Engineering and Applied Science (Computer Science), 2006. / Includes bibliographical references.

Heuristics for the dynamic facility layout problem with unequal area departments

Hakobyan, Artak. January 2008 (has links)
Thesis (Ph. D.)--West Virginia University, 2008. / Title from document title page. Document formatted into pages; contains xiii, 109 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 97-103).

Heuristic counterpoint

Ambrogi, Timothy. January 2004 (has links)
Thesis (B.A.)--Haverford College, Dept. of Computer Science, 2004. / Title from caption. Includes bibliographical references.

Container loading problem by a multi-stage heuristics approach /

Koo, Wai-yip. January 1997 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1998. / Includes bibliographical references (leaves 41-42).

Page generated in 0.1227 seconds