Search Sciweavers | Sciweavers

110 search results - page 3 / 22

» Interleaved Depth-First Search

click to vote

WADS
2001
Springer

126views Algorithms» more WADS 2001»

On External-Memory Planar Depth First Search

13 years 10 months ago

Download www.cs.brown.edu

Even though a large number of I/O-eﬃcient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-eﬃcient algo...

Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh

claim paper

Read More »

click to vote

AAAI
2010

219views Intelligent Agents» more AAAI 2010»

Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search

13 years 7 months ago

Download www.is.titech.ac.jp

Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...

Akihiro Kishimoto

claim paper

Read More »

click to vote

QSHINE
2005
IEEE

113views Computer Networks» more QSHINE 2005»

Solving The Multi-Constrained Path Selection Problem By Using Depth First Search

13 years 11 months ago

Download users.soe.ucsc.edu

An extended depth-ﬁrst-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...

Zhenjiang Li, J. J. Garcia-Luna-Aceves

claim paper

Read More »

click to vote

ICPP
1994
IEEE

93views Distributed And Parallel Com...» more ICPP 1994»

Distributed Algorithms for Constructing a Depth-First-Search Tree

13 years 10 months ago

Download dimacs.rutgers.edu

S. A. M. Makki, George Havas

claim paper

Read More »