• 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 5,285
Next 10 →

Table 1: Comparing gossip-based membership with RaWMS

in Abstract
by Ziv Bar-yossef, Roy Friedman, Gabriel Kliot 2006
"... In PAGE 20: ... 5.4 Comparison An asymptotic comparison of all the methods we mentioned above appears in Table1 . It compares the time and the communication complexity of the convergence period.... ..."

Table 1: Comparing RaWMS with gossip-based membership and flooding

in RaWMS -- Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks
by Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot 2006
"... In PAGE 7: ... 5.2 Comparison An asymptotic comparison of all the methods mentioned above appears in Table1 . Note that when nodes are mobile, there is an ad- ditional cost due to routing.... ..."
Cited by 6

Table 7: Empirical comparison on difierent SVM solvers

in Neighborhood Property based Pattern Selection For Support Vector Machines
by Hyunjung Shin, Sungzoon Cho 2006
"... In PAGE 39: ...as identical as in Section 5.2. The parameter of RSVM, the random sampling ratio, was set to 5{10% of training patterns according to Lee amp; Mangasarian (2001). In Table7 , the computational time of RSVM is shown as a ratio to the SVM training time of OSU-SVM. The results show that both of the algorithms are almost similar in accuracy.... ..."

Table 2: Classi cation of routing methods vis- a-vis their usage context

in Routing Algorithms for Content-based Publish/Subscribe Systems
by J. Legatheaux, Martins Sérgio Duarte 2007
"... In PAGE 25: ... The second aspect is very important since some proposals perform better if noti cations or subscriptions are uniformly distributed, while others excel when these distributions are highly skewed. Table2 presents the dependence / independence of each routing method vis- a-vis these three aspects. The gossip-based algorithm has been selected as representative of the semantic a nity method.... ..."

Table 3: BV BP BD. Since the number of iterations required is fairly small when BV is small, the SVM converged before the HERMES criterion was satisfied. The minor differ- ences in the results are due to the differing implementa- tions of the QP solver

in Stopping Criteria for SVMs
by Robert Burbidge
"... In PAGE 4: ... The only notable differences are for Adult4, with BV BP BDBC, where early stopping did slightly better (D4 BP BCBMBCBK), and Diabetes, with BV BP BDBCBCBC, where BSVM did slightly better (D4 BP BCBMBDBI). The number of iterations required by the SVM with and without early stopping are shown in Table3 and Table 4 for BV BP BDBN BDBCBCBC respectively. Also shown are the num- bers of support vectors.... ..."

Table 4: Available values of solver for the PETSc solvers.

in PHAML User’s Guide, Version 1.0
by William F. Mitchell, William F. Mitchell 2006
"... In PAGE 30: ... PHAML provides access to most of the methods in PETSc and several parameters to those methods. Table4 con- tains the available PETSc solvers as specified by solver. Table 5 contains the... ..."

Table 7: Available values of solver for the hypre solvers.

in PHAML User’s Guide, Version 1.0
by William F. Mitchell, William F. Mitchell 2006
"... In PAGE 31: ....3.4.3.2 hypre hypre [10][11] is a package of parallel iterative solvers and preconditioners from Lawrence Livermore National Laboratories. The hypre solvers are listed in Table7 and preconditioners are listed in Table 8. Note that the BoomerAMG solver does not use a preconditioner, and the ParaSails preconditioner cannot be used with the PCG solver.... ..."

Table 2: ISTL Solvers

in On the Generic Parallelisation of Iterative Solvers for the Finite Element Method
by Markus Blatt, Peter Bastian 2008
"... In PAGE 7: ... All solvers only use methods of instances of LinearOperator, ScalarProduct and Preconditioner. See Table2 for a list of available solvers. All solvers are Table 2: ISTL Solvers... ..."
Cited by 1

Table 5. ISTL Solvers

in The Iterative Solver Template Library
by Markus Blatt, Peter Bastian 2007
"... In PAGE 8: ... These are provided in the constructor. See Table5 for a list of available solvers. All solvers are template classes with... ..."
Cited by 2

Table 2. Comparison of solvers

in Modelling and Solving the Italian Examination Timetabling Problem Using Tabu Search
by Andrea Zampieri, Andrea Schaerf
"... In PAGE 4: ...76% Table 1. Features of the Instances Table2 shows a comparison of the results of the most promising solvers. For each solver, we run 10 trials for each instance and we report the minimum and the average cost.... In PAGE 4: ...Table 2. Comparison of solvers Table2 shows that the best results are obtained by solvers 2 and 4, which have the composition of the two TS (without and with HC, respectively). The difference between these two is small, in favour of solver 4.... In PAGE 4: ... Results using the restricted search space Table 3 shows the best results obtained using such a search space. It is easy to see that the results are much worse than those presented in Table2 . The fact that there would be a loss of quality was obvious, but the numerical difference 490... ..."
Next 10 →
Results 1 - 10 of 5,285
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