A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Interleaved Depth-First Search
1997
International Joint Conference on Artificial Intelligence
Preserved Fulltext
In tree search, depth-first search (DFS) often uses ordering successor heuristics. ...
To prevent this useless work, we present a new strategy called interleaved depthfirst search (IDFS), which searches depth-first several subtrees -called active-in parallel. ...
In this sense, IDFS interleaves depth-first search on active subtrees. ...
dblp:conf/ijcai/Meseguer97
fatcat:qir7kt6vqbh7lpeftdxe6uy3za
Exploring Complicated Search Spaces with Interleaving-Free Sampling
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
interleaved connections. ...
the interleaved connections to emerge in any of them. ...
It is worth noting that the depth of w/o IF is much
smaller than w/ IF, because the interleaved connections pro- In this section, we test IF-NAS in two micro search
duce serious interference ...
arXiv:2112.02488v1
fatcat:impwnx22snah3czqhqfbz6cvgu
The One Page Model Checker
[article]
2005
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We show how standard IPC mechanisms can be used with the fork() system call to perform explicit state model checking on all interleavings of a multithreaded application. ...
Search Algorithm Our algorithm for performing a depth first search on all possible execution interleavings of two threads t0 and t1 is as follows: • Base case: Let I be the initial partial interleaving ...
Since our algorithm performs a depth first search on the possible thread interleavings, the second occurrance of a combined execution counter can only occur once all the remaining interleavings from that ...
arXiv:cs/0506084v1
fatcat:ppzmuqw2g5fobhm4c34axq6kyi
A low complexity algorithm of blind estimation of convolutional interleaver parameters
2012
Science China Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The product of the depth and width of the interleaver is firstly determined by analyzing interleaved data stream. ...
Thus the delay, the depth and width of the convolutional interleaver can be estimated by analyzing the deinterleaved data streams. ...
We first estimate the product of the depth and width of the interleaver by analyzing the interleaved data stream. ...
doi:10.1007/s11432-012-4673-9
fatcat:ajcerye2u5e5ngvor37fvk5rsq
Heuristics for model checking Java programs
2004
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In this paper we present an array of heuristic model checking techniques for combating the state space explosion when searching for errors. ...
Some techniques for dealing with the most crucial problem in model checking, the state space explosion problem, concentrate on the first of these goals. ...
Search strategy Definition
BFS
A breadth-first search.
DFS
A depth-first search. (depth n) indicates that stack depth is limited to n.
best
Table 3 . 3 Search strategies. ...
doi:10.1007/s10009-003-0130-9
fatcat:azqzw44fezg6lfcee3zow4rr4e
23.2 A 1920×1080 30fps 611 mW five-view depth-estimation processor for light-field applications
2015
2015 IEEE International Solid-State Circuits Conference - (ISSCC) Digest of Technical Papers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Figure 23.2.4 shows the four-bank interleaving architecture, addressing two design issues of the BP engine. The first is the 8-cycle pipelined BPMUB. ...
The first stage is for data cost generation, which measures the pixel difference between the central view and its surrounding views for each tested depth value. ...
Figure 23.2.4 shows the four-bank interleaving architecture, addressing two design issues of the BP engine. The first is the 8-cycle pipelined BPMUB. ...
doi:10.1109/isscc.2015.7063106
dblp:conf/isscc/ChenHWHMC15
fatcat:nxfsod2xvbcahh4j2qpnsuedm4
Algorithm portfolios
2001
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
In particular, we will see how, in a portfolio setting, it can be advantageous to use a more "risk-seeking" strategy with a high variance in run time, such as a randomized depth-first search approach in ...
One can take advantage of such differences by combining several algorithms into a portfolio, and running them in parallel or interleaving them on a single processor. ...
Fig. 3 . 3 Cost profiles for a logistics planning problems for depth-first and best-bound search strategies.
Fig. 4 . 4 Heavy-tailed behavior of depth-first search. ...
doi:10.1016/s0004-3702(00)00081-3
fatcat:mh7jxfvysrhvrgw4rixjoyxtsy
Dynamic Optimality—Almost
2007
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
This is the first major progress on Sleator and Tarjan's dynamic optimality conjecture of 1985 that O(1)-competitive binary search trees exist. 1. Move the pointer to its left child. 2. ...
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). ...
To cut an augmented tree A at depth d, first observe that the nodes of depth greater than d form an interval of key space within A. ...
doi:10.1137/s0097539705447347
fatcat:73xzwxzk45fezh57ggjy5rebsq
Predicting Serializability Violations: SMT-Based Search vs. DPOR-Based Search
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We also describe details of our DPOR-based explicit search and pruning, and present an experimental evaluation comparing the two search techniques. ...
The exploration of the predictive model to check alternate interleavings of events in the execution was performed explicitly, based on stateless model checking using dynamic partial order reduction (DPOR ...
It first provides details of an explicit search algorithm that explores possible interleavings using specialized heuristics in a DPOR based search. (This was not described in [29] ). ...
doi:10.1007/978-3-642-34188-5_11
fatcat:23aj4d2sjbfsbjkvfnq3ad5a3e
A Multi-Core Sphere Decoder VLSI Architecture for MIMO Communications
2008
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Previous work has focused on implementations based on K-best or depth-first search, limiting the BER performance or the search speed. ...
This paper presents a scalable multi-core sphere decoder architecture that can combine the advantages of the K-best and depth-first search methods. ...
Depth-First Algorithm The depth-first algorithm [2] [3] starts the search from the root of the tree, Fig. 2(a) , and explores as far as possible along each branch. ...
doi:10.1109/glocom.2008.ecp.633
dblp:conf/globecom/YangM08
fatcat:3uksnxp4b5an5oy2u6kzu4bpi4
Concurrent Operations in Extendible Hashing
1986
Very Large Data Bases Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The algorithm is deadlock free and allows the search operations to proceed concurrently with insertion operations without having to acquire locks on the directory entries or the data pages. ...
It is spurious to consider an interleaved schedule C correct if it results in a failure of a search operation (i.e., the search operation does not find the key it is looking for) while the search operation ...
Search Algorithm The search operation on an extendible hash file consists of (1) applying the hash lunction to obtain a pseudo key, (2) examining the first q bits of the pseudo key to determine the directory ...
dblp:conf/vldb/HsuY86
fatcat:pkww6crbfvd2bokablaxhwxure
State space caching revisited
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This makes for the first time state space caching a very efficient verification method. ...
Indeed, almost all states in the state space of concurrent systems are typically reached several times during the search. ...
Figure 4 compares the performances of Algorithm 1 (classical depth-first search) and Algorithm 2 (depth-first search with sleep sets) for various cache sizes. ...
doi:10.1007/3-540-56496-9_15
fatcat:waxk6qsd4vhpbhaf4szx6s6a7q
Heuristic Model Checking for Java Programs
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Note how the limited depth DFS searches find much longer counterexamples in each case. ...
Other options include using the sum of two heuristics, limiting the size of the search queue 1 (sacrificing completeness for focused exploration), and using an A * search rather than the default best-first ...
doi:10.1007/3-540-46017-9_21
fatcat:brxkgjn6erdmlf6ccsdckduiqi
CONCURRIT
2013
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation - PLDI '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Further, the programmer can specify how these thread schedules should be searched to find a schedule that reproduces the bug. ...
Oracle for depth-first search In our framework, we implement search by following a depth-first search (DFS) strategy. ...
Different oracles, however, will differ in the order in which the interleavings are explored. gies, such as breadth-first and depth-first search. ...
doi:10.1145/2491956.2462162
dblp:conf/pldi/ElmasBNS13
fatcat:5a3rjabojfarfgz7mptxoyjn2q
CONCURRIT
2013
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Further, the programmer can specify how these thread schedules should be searched to find a schedule that reproduces the bug. ...
Oracle for depth-first search In our framework, we implement search by following a depth-first search (DFS) strategy. ...
Different oracles, however, will differ in the order in which the interleavings are explored. gies, such as breadth-first and depth-first search. ...
doi:10.1145/2499370.2462162
fatcat:iwrufg3nargpdd6dxcgled47q4
« Previous
Showing results 1 — 15 out of 22,873 results