Depth-first iterative-deepening: an optimal admissible tree search
about
Solving combinatorial problems: the 15-puzzle.An efficient parallel algorithm for accelerating computational protein design.Quantum iterative deepening with an application to the halting problemA distributed query execution engine of big attributed graphs.Deterministic Agent-Based Path Optimization by Mimicking the Spreading of Ripples.Parallelization of enumerating tree-like chemical compounds by breadth-first search order.Game playing.Dependence of prevalence of contiguous pathways in proteins on structural complexity.Adversarial search by evolutionary computation.Heuristic search in constrained bipartite matching with applications to protein NMR backbone resonance assignment.Directed explicit-state model checking in the validation of communication protocolsPartial-order reduction and trail improvement in directed model checkingSequential quadratic programming-based fast path planning algorithm subject to no-fly zone constraintsLearning Relational Bayesian Classifiers from RDF DataArtificial intelligence and a universal quantum computerRealizing the exploration and rearrangement of multiple unknown objects by an actual mobile robotParallel multithreaded IDA* heuristic search: algorithm design and performance evaluationAcceleration strategies for the weight constrained shortest path problem with replenishment
P2860
Q33342131-41864CF4-6C93-444F-B204-66508422F8E0Q33760390-292FCD98-50C1-4494-A31D-4F76739E28FCQ34631678-7A84E273-A5AE-4F95-8D18-718FADB1401DQ38408679-EB6F6337-2C9D-4758-965C-14F7BFB79347Q40844265-F76931A7-80B6-4C1E-9D86-2B175C7482C8Q42228512-EEBBECCC-CEE8-44CB-8C67-DA04E2ED2106Q45957645-CE54D0C2-1FD7-4C81-81BB-079C19229210Q47138157-56785B3F-0660-4FC0-80DC-1C00E0B6FAA2Q51642691-47E182E2-5C89-4994-A7D2-A34DD53E9891Q51957556-78891424-F121-40A6-99E2-F64629868F1FQ56501954-6A944C58-23A6-4254-ABC7-B10CAD9AC480Q56501959-CD7F83B3-7E9D-4A87-B9AD-D8ED5AABF2FBQ56945355-FF8FEF8A-4910-4D55-B15F-A4FEC985DA0DQ57015152-A5E408F8-4F3F-4249-95E3-B7AB5BF53A9FQ57696145-0BCF4A93-3A12-48B0-A0CD-9B3498CC6921Q58025507-F00A7DD1-2F0F-4228-BFA6-3C889E7FE574Q58215145-61773604-C1E3-4A98-A756-AFDBBEBE620CQ58759978-35EEF5D5-B442-4112-A3C5-EE967762BD78
P2860
Depth-first iterative-deepening: an optimal admissible tree search
description
im September 1985 veröffentlichter wissenschaftlicher Artikel
@de
wetenschappelijk artikel
@nl
наукова стаття, опублікована у вересні 1985
@uk
name
Depth-first iterative-deepening
@nl
Depth-first iterative-deepening: an optimal admissible tree search
@en
type
label
Depth-first iterative-deepening
@nl
Depth-first iterative-deepening: an optimal admissible tree search
@en
prefLabel
Depth-first iterative-deepening
@nl
Depth-first iterative-deepening: an optimal admissible tree search
@en
P1476
Depth-first iterative-deepening
@en
P304
P356
10.1016/0004-3702(85)90084-0
P407
P577
1985-09-01T00:00:00Z