Matches in SemOpenAlex for { <https://semopenalex.org/work/W2011790867> ?p ?o ?g. }
Showing items 1 to 61 of
61
with 100 items per page.
- W2011790867 endingPage "36" @default.
- W2011790867 startingPage "33" @default.
- W2011790867 abstract "The Iterative Deepening A∗ (IDA∗) (R.E. Korf, Artificial Intelligence 27 (1985)) algorithm often reexpands too many nodes while solving certain combinatorial problems. Algorithm IDA∗_CR (U.K. Sarkar, Artificial Intelligence 50 (1991)) attempted to remedy this drawback. These algorithms require very little memory although much more is available in practice. This paper introduces an algorithm IDA∗_CRM which shows how the available memory can be advantageously utilized in IDAast;_CR in order to reduce the number of expanded nodes. IDA∗_CRAM, an approximation scheme derived from IDA∗_CRM, is also presented. Computational results are shown for the Flow-Shop Scheduling Problem." @default.
- W2011790867 created "2016-06-24" @default.
- W2011790867 creator A5008983984 @default.
- W2011790867 creator A5012765753 @default.
- W2011790867 creator A5024219981 @default.
- W2011790867 creator A5069528246 @default.
- W2011790867 date "1989-01-01" @default.
- W2011790867 modified "2023-09-26" @default.
- W2011790867 title "Increasing search efficiency using multiple heuristics" @default.
- W2011790867 cites W1995927890 @default.
- W2011790867 cites W2134634502 @default.
- W2011790867 cites W2152475379 @default.
- W2011790867 doi "https://doi.org/10.1016/0020-0190(89)90171-3" @default.
- W2011790867 hasPublicationYear "1989" @default.
- W2011790867 type Work @default.
- W2011790867 sameAs 2011790867 @default.
- W2011790867 citedByCount "9" @default.
- W2011790867 countsByYear W20117908672012 @default.
- W2011790867 countsByYear W20117908672013 @default.
- W2011790867 countsByYear W20117908672015 @default.
- W2011790867 countsByYear W20117908672018 @default.
- W2011790867 crossrefType "journal-article" @default.
- W2011790867 hasAuthorship W2011790867A5008983984 @default.
- W2011790867 hasAuthorship W2011790867A5012765753 @default.
- W2011790867 hasAuthorship W2011790867A5024219981 @default.
- W2011790867 hasAuthorship W2011790867A5069528246 @default.
- W2011790867 hasConcept C11413529 @default.
- W2011790867 hasConcept C126255220 @default.
- W2011790867 hasConcept C127705205 @default.
- W2011790867 hasConcept C154945302 @default.
- W2011790867 hasConcept C206729178 @default.
- W2011790867 hasConcept C33923547 @default.
- W2011790867 hasConcept C41008148 @default.
- W2011790867 hasConceptScore W2011790867C11413529 @default.
- W2011790867 hasConceptScore W2011790867C126255220 @default.
- W2011790867 hasConceptScore W2011790867C127705205 @default.
- W2011790867 hasConceptScore W2011790867C154945302 @default.
- W2011790867 hasConceptScore W2011790867C206729178 @default.
- W2011790867 hasConceptScore W2011790867C33923547 @default.
- W2011790867 hasConceptScore W2011790867C41008148 @default.
- W2011790867 hasIssue "1" @default.
- W2011790867 hasLocation W20117908671 @default.
- W2011790867 hasOpenAccess W2011790867 @default.
- W2011790867 hasPrimaryLocation W20117908671 @default.
- W2011790867 hasRelatedWork W1489675356 @default.
- W2011790867 hasRelatedWork W1522517976 @default.
- W2011790867 hasRelatedWork W1756885467 @default.
- W2011790867 hasRelatedWork W2034983601 @default.
- W2011790867 hasRelatedWork W2094356724 @default.
- W2011790867 hasRelatedWork W2097843717 @default.
- W2011790867 hasRelatedWork W2884576438 @default.
- W2011790867 hasRelatedWork W2905364337 @default.
- W2011790867 hasRelatedWork W3042941765 @default.
- W2011790867 hasRelatedWork W4225871777 @default.
- W2011790867 hasVolume "30" @default.
- W2011790867 isParatext "false" @default.
- W2011790867 isRetracted "false" @default.
- W2011790867 magId "2011790867" @default.
- W2011790867 workType "article" @default.