Results 1 - 10 of 4,338

Table 8: Compiled diagnosis on tree-structured circuits

in Efficient Consequence Finding
by Laurent Simon, Alvaro Del Val 2001
"... In PAGE 6: ... To our knowledge, this is the first time such instances are tested with a direct consequence-finding approach. Table8 presents results for bnp-ab circuits for the much harder compiled approach to diagnosis, where we basically precompute C8C1C4CE for all possible input-output vectors, by computing C8C1C4BTBUCJC7CJC1 . Clearly, in this case it pays off to use the vocabulary-based procedures (as opposed to full PIs) for both tries and ZBDDs.... ..."
Cited by 12

Table 1: Learning Algorithm for Tree-structured Bias

in Learning from Queries and Examples with Tree-structured Bias
by Prasad Tadepalli 1993
Cited by 7

TABLE I NOTATION FOR TREE-STRUCTURED NON-LINEAR MEDIA

in Scalable On-Demand Streaming of Non-Linear Media
by Yanping Zhao, Derek Eager, Mary K. Vernon
Cited by 1

TABLE I NOTATION FOR TREE-STRUCTURED NON-LINEAR MEDIA

in Scalable On-Demand Streaming of Non-Linear
by Media Yanping Zhao, Yanping Zhao, Derek Eager
Cited by 1

TABLE I NOTATION FOR TREE-STRUCTURED NON-LINEAR MEDIA

in Scalable On-Demand Streaming of Non-Linear Media
by Yanping Zhao, Derek Eager, Mary K. Vernon
Cited by 1

TABLE I NOTATION FOR TREE-STRUCTURED NON-LINEAR MEDIA

in Scalable On-Demand Streaming of Non-Linear Media
by Yanping Zhao, Derek Eager
Cited by 1

TABLE I: Notation for Tree-Structured Non-Linear Media

in Scalable On-Demand Streaming of Non-Linear Media
by Yanping Zhao, Derek L. Eager, Mary K. Vernon
Cited by 1

Table 8: Compiled diagnosis on tree-structured circuits

in Efficient Consequence Finding
by Laurent Simon, Alvaro del Val
"... In PAGE 6: ... To our knowledge, this is the first time such instances are tested with a direct consequence-finding approach. Table8 presents results for bnp-ab circuits for the much harder compiled approach to diagnosis, where we basically precompute PILV for all possible input-output vectors, by computing PILAB[O[I. Clearly, in this case it pays off to use the vocabulary-based procedures (as opposed to full PIs) for both tries and ZBDDs.... ..."

Table 3: Tree Structure Parameters

in FOR THE COMMANDER
by G. A. Shaw, Gary Tutungian, G. A. Shaw 1998

Table 4. Mean Setup Delay of the Ring Protocol The setup delay of the ring protocol is smaller only for class C2 and the 70-30 load, where the retry probability is high when using a multicast protocol. However, the performance of class C1 slightly deteriorates, because apart from the delay caused by the overload on SRV1 the sequential nature of the acquisition method imposes an additional delay. The overall setup delay nevertheless decreases, because the gains for the C2 class carry more weight. For the 60-40 load both classes exhibit longer setup delays with the sequential method because of the extra acquisition overhead, even though there is no overload. It is important to note that both protocols can be viewed as special cases of a more general, tree-structured protocol family, with nodes indicating the protocol (multicast or ring) employed for acquiring a particular group of abstract resources, themselves also being nodes (Figure 27). The leaves of the tree are resource groups consisting of a single resource type.

in Effects of an Asynchronous Resource Allocation Protocol on End-to-End Service Provision
by Spyros Lalis , Manolis Marazakis, Dimitris Papadakis 1998
"... In PAGE 13: ... For this reason, the choice of the retry policy is also irrelevant for the ring protocol. However, this method comes with its own weaknesses, as it can be inferred from Table4 that gives the mean setup... ..."
Results 1 - 10 of 4,338