• 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 57,571
Next 10 →

Table II. Performances on large programs. Problems (21)-(26) are tight. Problems (27)-(39) are non tight.

in Answer set programming based on propositional satisfiability
by Enrico Giunchiglia, Yuliya Lierler, Marco Maratea 2006
Cited by 8

Table I Selected Electronic Proceedings in Computer Science

in The Roles of Video in the Design, Development, and Use of Interactive Electronic Conference Proceedings
by Samuel A. Rebelsky, Fillia Makedon, James Ford, Charles Owen, Peter A. Gloor, Coopers Lybrand, P. Takis Metaxas

Table 1: Unoptimized/Optimized Execution times in msec (Speedups are shown in parenthesis) [7] M. V. Hermenegildo. An Abstract Machine Based Execution Model for Computer Architecture Design and E cient Implementation of Logic Programs in Parallel. PhD thesis, U. of Texas at Austin, August 1986. [8] K. Muthukumar and M. Hermenegildo. Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In 1991 International Conference on Logic Programming. MIT Press, June 1991. [9] Swedish Institute of Computer Science. Industrial Sicstus Prolog Internals Manual, 1989.

in ACE: A High-Performance Parallel Prolog System
by Enrico Pontelli, Manuel Hermenegildo, Gopal Gupta 1995
"... In PAGE 11: ... The results for the following benchmarks are initially reported: Matrix Multiplication, Quicksort, Takeuchi, Tower of Hanoi, Boyer (a reduced version of the Boyer-Moore theorem prover), Compiler (the Aquar- ius Prolog compiler from UC Berkeley that is approxi- mately 2,200 lines of Prolog code), Poccur (A list pro- cessing program), BT cluster (A clustering program from British Telecom, UK), Annotator (the annotator part of the amp;-Prolog parallelizing compiler that is about 1,000 lines) and, Simulator (a simulator for simulating parallel Prolog execution that is about 1,100 lines). Table1 indicates, for each benchmark, the execu- tion time (in ms.) and the speed-up obtained.... In PAGE 11: ... The speed-up gures are with respect to the optimized execution. Table1 illustrates the speedups obtained for the var- ious benchmarks. The gures clearly indicate that the current implementation, even though not completely op- timized, is quite e ective.... In PAGE 11: ... These optimizations yield, depending on the program, an improvement of 5% to 25% over the unoptimized version. Some improve- ment data is shown in Table1 (each entry in Table 1 shows the time in milliseconds before the optimization and after the optimization; the number in parenthesis gives the speed-up obtained; for compiler and simulator benchmarks the unoptimized gure is not shown). As is obvious, improvements due to optimization can be sub- stantial; in some cases superlinear speedup is obtained.... ..."
Cited by 42

Table 6: English words most similar to ~,~/li-

in An IR Approach for Translating New Words from Nonparallel, Comparable Texts
by Pascale Fung, Lo Yuen Yee

Table 6: English words most similar to iN~/li-

in 1 Introduction An IR Approach for Translating New Words from Nonparallel, Comparable Texts
by Pascale Fung, Lo Yuen Yee

Table 2. The Octopus of Logic for Computer Science.

in The Prospects For Mathematical Logic In The Twenty-First Century
by Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore, Richard A 2001
"... In PAGE 10: ... Logic for computer science. A skeletal overview of the present state of a airs for applications of logic to computer science is presented in Table2 , which is titled the \octopus of logic for computer science. quot; I have not attempted to make a de nitive summary of the applications of logic to computer science in Table 2, as they are far too numerous and varied for me to make such an attempt.... In PAGE 10: ... A skeletal overview of the present state of a airs for applications of logic to computer science is presented in Table 2, which is titled the \octopus of logic for computer science. quot; I have not attempted to make a de nitive summary of the applications of logic to computer science in Table2 , as they are far too numerous and varied for me to make such an attempt. The main point of the table is to illustrate how diverse and and extensive the applications of logic for computer science have become.... In PAGE 11: ...in computer science as well: in Table2 these include nite model theory, database theory, and model-checking. More generally, whenever one deals with the semantics of a language, one is implicitly doing model theory.... ..."
Cited by 3

Table 2. The Octopus of Logic for Computer Science.

in The Prospects For Mathematical Logic In The Twenty-First Century
by Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore 2001
"... In PAGE 10: ... Logic for computer science. A skeletal overview of the present state of affairs for applications of logic to computer science is presented in Table2 , which is titled the octopus of logic for computer science. I have not attempted to make a definitive summary of the applications of logic to computer science in Table 2, as they are far too numerous and varied for me to make such an attempt.... In PAGE 10: ... A skeletal overview of the present state of affairs for applications of logic to computer science is presented in Table 2, which is titled the octopus of logic for computer science. I have not attempted to make a definitive summary of the applications of logic to computer science in Table2 , as they are far too numerous and varied for me to make such an attempt. The main point of the table is to illustrate how diverse and extensive the applications of logic for computer science have become.... In PAGE 11: ...in computer science as well: in Table2 these include finite model theory, database theory, and model-checking. More generally, whenever one deals with the semantics of a language, one is implicitly doing model theory.... ..."
Cited by 3

Table 2. The Octopus of Logic for Computer Science.

in Prospects for mathematical logic in the twenty-first century
by Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A 2001
"... In PAGE 10: ... Logic for computer science. A skeletal overview of the present state of a airs for applications of logic to computer science is presented in Table2 , which is titled the \octopus of logic for computer science. quot; I have not attempted to make a de nitive summary of the applications of logic to computer science in Table 2, as they are far too numerous and varied for me to make such an attempt.... In PAGE 10: ... A skeletal overview of the present state of a airs for applications of logic to computer science is presented in Table 2, which is titled the \octopus of logic for computer science. quot; I have not attempted to make a de nitive summary of the applications of logic to computer science in Table2 , as they are far too numerous and varied for me to make such an attempt. The main point of the table is to illustrate how diverse and extensive the applications of logic for computer science have become.... In PAGE 11: ...in computer science as well: in Table2 these include nite model theory, database theory, and model-checking. More generally, whenever one deals with the semantics of a language, one is implicitly doing model theory.... ..."
Cited by 3

Tables and Formulae, 30th ed., CRC Press, Boca Raton, 1996. [28] K.F. Chan, D.Y. Yeung, Elastic structural matching for on-line handwritten alphanumeric character recognition, in Proceedings of the 14th International Conference on Pattern Recognition, Brisbane, Australia, 1998, pp.

in An Efficient Syntactic Approach to Structural Analysis of On-line Handwritten Mathematical Expressions
by Kam-Fai Chan, Dit-Yan Yeung

Table Animation of Fast Oriented Line Integral Convolution for Vector Field Visualization, Proceedings of the 8- th International Conference in Central Europe on Computer Graphics, Visu- alization and Interactive Digital Me- dia apos;2000, 2000, pp. 4-11.

in A Survey on Visualization of Vector Fields By Texture-Based Methods
by A. Sanna, P. Montuschi, P. Montuschi 2000
Cited by 12
Next 10 →
Results 1 - 10 of 57,571
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