• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 46,436
Next 10 →

Table 1. Fraction of Terminals in Various Classes for Downlink

in Dynamic Allocation of Downlink and Uplink Resource for Broadband Services in Fixed Wireless Networks
by Kin K. Leung, Arty Srivastava 1999
"... In PAGE 16: ... 6.2 Fractions of Terminals in Various Classes for the Downlink Following the classification method in Section 3, Table1 presents the fraction of terminals in various classes for the SIR threshold of 15 dB. Results with or without BS and sector selection (to be called BS selection in short) are included.... In PAGE 17: ... Without BS selection, the coverage is 85.94% in Table1 ; that is, the remaining 14.06% of terminals cannot be served because they cannot meet the SIR threshold due to strong inter-cell interference, even when there is only one packet transmission in each cell at a time.... In PAGE 19: ... As for the ESRA method, when traffic load is below 36.1% (as indicated in Table1 ), all packet transmission will be successful as its SIR is higher than the 15dB threshold as verified by the procedure for terminal classification. When traffic load goes beyond 36.... ..."
Cited by 4

Table 3: Failure behaviour of the various classes of algorithms

in A Classification of Update Methods for Replicated Databases
by Stefano Ceri, Maurice A. W. Houtsma, Arthur M. Keller, Pierangela Samarati 1991
Cited by 17

Table 1: Various classes of valued constraint networks

in Valued Constraint Networks
by Thomas Schiex 2000
Cited by 6

Table 3: Failure behaviour of the various classes of algorithms

in A classification of update methods for replicated databases
by Stefano Ceri, Maurice A. W. Houtsma, Arthur M. Keller, Pierangela Samarati 1991
Cited by 5

Table 3: Timings for various class numbers.

in Generating Elliptic Curves of Prime Order
by Erkay Savas , Thomas A. Schmidt, Çetin K. Koç 2001
"... In PAGE 9: ... Note also, just as the theoretical heuristics of the next section suggest, that the time to find an admissible pair (p, u) decreases with the size of D. This can be observed in Table3 . See also the Figures 2, 3, 4, 5, 6, 7.... ..."
Cited by 2

Table 6:Average service times in ms at each server for the various classes.

in A quantitative study of public key infrastructures
by D. Bruschi, A. Curti, E. Rosti 2001
"... In PAGE 8: ... Class1self-signed certification requests Class2revocation request from the user Class3CRL generation Class4cross-certification requests Class5RA-generated certification requests Class6revocation request from the RA Table 5:Customer classes characterizing the workload of the PKI. Table6 reports the services times for each class at the various servers. We solved six single class models analytically, one for each workload class, varying the population size from 1 to N such that the system throughput X(N) saturates.... In PAGE 8: ... We solved six single class models analytically, one for each workload class, varying the population size from 1 to N such that the system throughput X(N) saturates. As it can be seen from Table6 , the... ..."
Cited by 1

Table 1: Test for necessary and sufficient conditions for various classes of codes for PCRC.

in unknown title
by unknown authors 708
"... In PAGE 24: ...Discussion and Simulation Results The results of our necessary and sufficient conditions (16), (46) and (47) as well as the sufficient condition in [18], evaluated for various classes of codes for PCRC are shown in Table 1. As can be seen from the last column of Table1 , the sufficient condition in [18] identifies only COD2 (Alamouti) and CUW4 as SSDs for PCRC. However, our conditions (16, (46) and (47) identify CIOD4, RR8, and CODs from RODs, in addition to COD2 and CUW4, as SSDs for PCRC (4th column of Table 1).... In PAGE 24: ... As can be seen from the last column of Table 1, the sufficient condition in [18] identifies only COD2 (Alamouti) and CUW4 as SSDs for PCRC. However, our conditions (16, (46) and (47) identify CIOD4, RR8, and CODs from RODs, in addition to COD2 and CUW4, as SSDs for PCRC (4th column of Table1 ). It is noted that, CIOD4 being a construction by using G = COD2 in (50) and coordinate interleaving, it is SSD for PCRC from Lemma 2 and Theorem 4.... ..."

Table 2. Comparison of the IGA performance on the wine data with various class settings

in Incremental learning of collaborative classifier agents with new class acquisition: an incremental genetic algorithm approach
by Sheng-uei Guan, Fangming Zhu 2003
"... In PAGE 19: ...We have experimented with different settings of classes, and compared the performance of different IGA approaches. Table2 summarizes the results of three experiments with different class combinations. For each experiment, GA runs in parallel for agent 1 and 2.... ..."
Cited by 3

Table 3. Comparison of the IGA performance on the iris data with various class settings

in Incremental learning of collaborative classifier agents with new class acquisition: an incremental genetic algorithm approach
by Sheng-uei Guan, Fangming Zhu 2003
"... In PAGE 20: ... We still conduct three experiments on the iris data, and compare the performance of re-training GA and four IGA approaches. Table3 shows the results, and the table structure is the same as that for the wine data. ... ..."
Cited by 3

Table 4. Comparison of IGA performance of on the glass data with various class settings

in Incremental learning of collaborative classifier agents with new class acquisition: an incremental genetic algorithm approach
by Sheng-uei Guan, Fangming Zhu 2003
"... In PAGE 23: ... The number in bold means the best performance of GA/IGA approaches in each experiment. Table4 shows the results of three experiments on the glass data. As the glass data has ... ..."
Cited by 3
Next 10 →
Results 1 - 10 of 46,436
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University