Nothing Special   »   [go: up one dir, main page]

Brown et al., 1982 - Google Patents

An empirical comparison of backtracking algorithms

Brown et al., 1982

Document ID
13320351411357606085
Author
Brown C
Purdom P
Publication year
Publication venue
IEEE Transactions on Pattern Analysis and Machine Intelligence

External Links

Snippet

In this paper we report the results of experimental studies of zero-level, one-level, and two- level search rearrangement backtracking. We establish upper and lower limits for the size problem for which one-level backtracking is preferred over zero-level and two-level …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30705—Clustering or classification
    • G06F17/3071—Clustering or classification including class or cluster creation or modification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring

Similar Documents

Publication Publication Date Title
Bentley et al. An optimal worst case algorithm for reporting intersections of rectangles
Bhanot The metropolis algorithm
Hopcroft et al. Efficient planarity testing
Brown et al. An empirical comparison of backtracking algorithms
Solomonoff The time scale of artificial intelligence: Reflections on social effects
Yashchin On the analysis and design of CUSUM-Shewhart control schemes
Fitting et al. Beyond two: Theory and applications of multiple-valued logic
Chen et al. Efficient branch and bound search with application to computer-aided design
Wagner A shortest path algorithm for edge-sparse graphs
Krentel On finding and verifying locally optimal solutions
Xu et al. Learning-augmented algorithms for online steiner tree
US20050021486A1 (en) Solving constraint satisfaction problems using variable-range hopping
Junttila Patterns in permuted binary matrices
Booth et al. Performance abstract data types as a tool in software performance analysis and design
Imbrea Automated machine learning techniques for data streams
Chinneck Feasibility and viability
Rauzy et al. Assessment of large automatically generated fault trees by means of binary decision diagrams
Houston et al. The distribution of term usage in manipulative indexes
Olson An approximation algorithm for least median of squares regression
Pavelski et al. Meta-learning for optimization: A case study on the flowshop problem using decision trees
JPH0855029A (en) Inference device for cause
Carletti et al. The VF3-light subgraph isomorphism algorithm: when doing less is more effective
Hao et al. An empirical comparison of two evolutionary methods for satisfiability problems
Britcher Using inspections to investigate program correctness
Seminaroti Combinatorial algorithms for the seriation problem