• 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 182,691
Next 10 →

Table 1. Summary of Initial Results

in Solving a Real World Routing Problem using Multiple Evolutionary Agents
by Neil Urquhart, Peter Ross, Ben Paechter, Ken Chisholm 2002
"... In PAGE 5: ...sults may be seen in Table1 . The maximum length value was set at 3km.... ..."
Cited by 1

Table 1 Initial results on for image annotation experiments

in ABSTRACT A Bootstrapping Approach to Annotating Large Image Collection
by unknown authors
"... In PAGE 6: ... 6.2 Initial Experiment Results Table1 shows our initial results for the 5 methods. The results are presented in terms of recall, precision and F1 measures.... In PAGE 6: ... The cloud and sky are likely to be learned in the automated approach, which should be considered as correct. From Table1 , we found that methods (Methods 1 and 4) that did not make use of the decision making disambiguation step generally have low performance. They could achieve about an average of 20%-27% for ACR and 28%-34% for MCR in F1 measures.... ..."

Table 1BM Initial Results from Testbed

in unknown title
by unknown authors 2000
"... In PAGE 6: ... We perform the following simple G2 D2 G3 G4 D3 Video Client Host Video Client Host Video Client Host G1 D1 Video Server III II I Figure 6: Testbed for MeGaDiP prototype experiment and obtain some initial results: the video server submits media gateway queries for the 15 clients (sessions) within a period of 5 minutes, and the submission times are uniformly distributed. Table1 shows: (1) the number of video sessions that result in the discovery of BZCXBN CX BP BDBN BEBN BFBN BG by MeGaDiP, and (2) the corresponding (average) response time of MeGaDiP. The values are averaged over 10 trials.... ..."
Cited by 10

Table 2. Initial Results Relational Versus Multidimensional

in A PARADIGM SHIFT IN DATABASE OPTIMIZATION: FROM INDICES TO AGGREGATES
by Ryan Labrie, Robert St. Louis, Lin Ye
"... In PAGE 4: ...HERE ([TimeDim].[All TimeDim].[1993].[Quarter 3]) Results Table2 below shows the results of running TPC-H Query 4 on a the relational data warehouse using SQL, and the results of running the same query on a dimensional data mart using MDX with an aggregate. Note that the MDX query ran 141 times faster than the SQL query.... ..."

Table 2: Initial Results Visit to Asia

in THE EFFECTS OF DATA QUALITY ON MACHINE LEARNING ALGORITHMS (Research-in-Progress – IQ Concepts, Tools, Metrics, Measures, Models, and Methodologies)
by Valerie Sessions, Marco Valtorta
"... In PAGE 6: ... Using a causal interpretation of BNs, we then categorized the number of incorrect edges as the addition of the number of misoriented, false positive, and false negative edges. The results for Visit to Asia are show in tabular form in Table2 , and graphical form ... In PAGE 8: ... Our test results confirm this observation. Even from a cursory overview of the results in Table2 and Figure 3, it is evident that the PC learning algorithm is very intolerant of inaccuracies in the data. At only 10% inaccurate data, the algorithm had an increase in incorrect edges of 325% for 10,000 records.... ..."

Table 3. Initial results - dining philosophers

in Parallel Program Verification Using BMC
by Toni Jussila, Ilkka Niemelä 1984
"... In PAGE 7: ...70/6 The first column in each table give the number of philosophers and the number of the concurrent processes trying to access the critical section, respectively. The next four are: AF execution time of BCSat (in seconds) / the bound used with inter- leaving semantics AF execution time of ZChaff (in seconds) / the bound used with inter- leaving semantics AF execution time of BCSat (in seconds) / the bound used with step semantics AF execution time of ZChaff (in seconds) / the bound used with step semantics In Table3 the bound (number of steps) is the smallest number... ..."
Cited by 1

Table 4. Initial results - mutex protocol

in Parallel Program Verification Using BMC
by Toni Jussila, Ilkka Niemelä 1984
"... In PAGE 8: ...in the step case. In Table4 the mutex protocol satisfied the verified safety property and thus no model could be obtained. The bounds used are based on considerations of the diameter [4] of the associated Kripke structure.... ..."
Cited by 1

Table 3. Initial Results of Linear Programming Model

in A Goal Programming Approach to the Remanufacturing Supply Chain Model
by Elif Kongar, Surendra M. Gupta

Table 1: Initial results from DSR approximation

in Implementing Dynamic Semantic Resolution
by Simon Thornton

Table II. Initial Results Using Analytical Data

in Eigensystem Realization System . . .
by Richard S. Pappa , Axel Schenk, Christopher Noll
Next 10 →
Results 1 - 10 of 182,691
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