110 search results - page 9 / 22 » Interleaved Depth-First Search |
AAAI
2007
13 years 10 months ago
2007
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—Accurate and timely identification of the routerlevel topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomog...
FORTE
1994
13 years 9 months ago
1994
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
SIGIR
2010
ACM
14 years 10 days ago
2010
ACM
Interleaving experiments are an attractive methodology for evaluating retrieval functions through implicit feedback. Designed as a blind and unbiased test for eliciting a preferen...
WOA
2001
13 years 9 months ago
2001
Acting in a dynamic environment is a complex task that requires several issues to be investigated, with the aim of controlling the associated search complexity. In this paper, a l...