Sciweavers

110 search results - page 5 / 22
» Interleaved Depth-First Search
Sort
View
DAM
2011
13 years 3 months ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
IJAIT
2002
82views more  IJAIT 2002»
13 years 8 months ago
Interleaved Backtracking in Distributed Constraint Networks
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the ...
Youssef Hamadi
ASPDAC
2005
ACM
91views Hardware» more  ASPDAC 2005»
14 years 2 months ago
Efficiently generating test vectors with state pruning
- This paper extends the depth first search (DFS) used in the previously proposed witness string method for generating efficient test vectors. A state pruning method is added that ...
Ying Chen, Dennis Abts, David J. Lilja
TIT
2002
126views more  TIT 2002»
13 years 8 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
FGCS
2008
144views more  FGCS 2008»
13 years 8 months ago
Distributed strategic interleaving with load balancing
In a previous paper, we developed an algebraic theory of threads, interleaving of threads, and interaction of threads with services. In the current paper, we assume that the thread...
Jan A. Bergstra, C. A. Middelburg