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

CiteSeerX logo

Advanced Search Include Citations

Tools

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

Update Frequency

by unknown authors
"... Subject Coverage Inspec®, a bibliographic database, is comprised of abstracts Inspec covers five main subjects, organized by Subfile. and specialized indexing of the world's quality research literature in the fields of physics and engineering from journals Subfile A- Physics: elementary particl ..."
Abstract - Add to MetaCart
Subject Coverage Inspec®, a bibliographic database, is comprised of abstracts Inspec covers five main subjects, organized by Subfile. and specialized indexing of the world's quality research literature in the fields of physics and engineering from journals Subfile A- Physics: elementary particles and fields, and serials, conference papers and proceedings, books and atomic, molecular and nuclear physics, phenomenology, book chapters, and technical reports. Some standards, fluids, plasmas and electric discharges, condensed dissertations and a small number of UK and US patents matter: structure, thermal and mechanical properties, (published between 1968 and 1976) are included. All abstracts electronic structure, electrical, magnetic, and optical are in English; author-prepared abstracts are used when properties, cross-disciplinary physics and related areas, available. The database is produced by the Institution of geophysics, astronomy and astrophysics.

Amortized Efficiency of List Update and Paging Rules

by Daniel D. Sleator, Robert E. Tarjan , 1985
"... In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that move-to-front is within a constant factor of optimum amo ..."
Abstract - Cited by 824 (8 self) - Add to MetaCart
among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and frequency count rules, da not share this property. We generalize our results to show that move-to-front is within a constant factor of optimum as long as the access cost is a convex function. We also study

Update Frequency: Quarterly (reload)

by unknown authors , 2005
"... CLAIMS ® /REFERENCE (File 124) is a dictionary index to the two subject classifications which are searchable in the CLAIMS family of patent databases (File 340, 341, 942). File 124 describes these two distinct systems of indexing: (1) U.S. Patent Classification codes from the U.S. Patent and Tradema ..."
Abstract - Add to MetaCart
CLAIMS ® /REFERENCE (File 124) is a dictionary index to the two subject classifications which are searchable in the CLAIMS family of patent databases (File 340, 341, 942). File 124 describes these two distinct systems of indexing: (1) U.S. Patent Classification codes from the U.S. Patent and Trademark Office and (2) the UNITERM and CDB indexing system developed by IFI CLAIMS Patent Services. The description of the U.S. Patent Classification corresponds to the Manual of Classification and the Index to the U.S. Patent Classification issued by the U.S. Patent and Trademark Office. The UNITERM and CDB indexing terms correspond to the IFI/CLAIMS Vocabulary and Thesaurus for use in the CLAIMS ® /UNITERM (File 341) and CLAIMS ® /COMPREHENSIVE (File 942) databases.

Coverage: Update Frequency:

by Ei Compendex, Sample Searches
"... Classic: nexis.comSM lexis.com ® path: path: ..."
Abstract - Add to MetaCart
Classic: nexis.comSM lexis.com ® path: path:

Update Frequency: Quarterly (reload)

by unknown authors , 2005
"... CLAIMS ® /REFERENCE (File 124) is a dictionary index to the two subject classifications which are searchable in the CLAIMS family of patent databases (File 340, 341, 942). File 124 describes these two distinct systems of indexing: (1) U.S. Patent Classification codes from the U.S. Patent and Tradema ..."
Abstract - Add to MetaCart
CLAIMS ® /REFERENCE (File 124) is a dictionary index to the two subject classifications which are searchable in the CLAIMS family of patent databases (File 340, 341, 942). File 124 describes these two distinct systems of indexing: (1) U.S. Patent Classification codes from the U.S. Patent and Trademark Office and (2) the UNITERM and CDB indexing system developed by IFI CLAIMS Patent Services. The description of the U.S. Patent Classification corresponds to the Manual of Classification and the Index to the U.S. Patent Classification issued by the U.S. Patent and Trademark Office. The UNITERM and CDB indexing terms correspond to the IFI/CLAIMS Vocabulary and Thesaurus for use in the CLAIMS ® /UNITERM (File 341) and CLAIMS ® /COMPREHENSIVE (File 942) databases.

Update Frequency: Monthly

by unknown authors , 1981
"... nexis.comSM path: lexis.com ® path: ..."
Abstract - Add to MetaCart
nexis.comSM path: lexis.com ® path:

� Different update frequencies, forgotten update

by Xin Luna, Dong At, Data Fusion, Luna Dong, Felix Naumann, Origins Data Conflicts, Schering Crm, Bayer Crm, Data Fusion, Luna Dong, Felix Naumann, Origins Intra-source Conflicts
"... 7 � No integrity or consistency checks � Redundant schemata � Typos, transmission errors, incorrect calculations � Variants ..."
Abstract - Add to MetaCart
7 � No integrity or consistency checks � Redundant schemata � Typos, transmission errors, incorrect calculations � Variants

Optimization Flow Control, I: Basic Algorithm and Convergence

by Steven H. Low, David E. Lapsley - IEEE/ACM TRANSACTIONS ON NETWORKING , 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract - Cited by 694 (64 self) - Add to MetaCart
. In this system sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be different, substantial and time-varying, and links and sources to update

Appendix A: Database Update Frequency

by Price Increases , 1983
"... ..."
Abstract - Add to MetaCart
Abstract not found

The relation of Weight Update Frequency to Convergence of BP

by Jim Torresen, Olav Landsverk
"... This paper proposes a method for estimating the number of iterations required until convergence of a feed-forward neural network for any weight update frequency. The NETtalk neural application has been used to get data on convergence and the best learning rate. Our results show that less frequent we ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
This paper proposes a method for estimating the number of iterations required until convergence of a feed-forward neural network for any weight update frequency. The NETtalk neural application has been used to get data on convergence and the best learning rate. Our results show that less frequent
Next 10 →
Results 1 - 10 of 2,407
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