Filters








254,652 Hits in 7.2 sec

Abstracts

1969 IBM Systems Journal  
The main threshold operator is a linear function of the average contrast over a specified area.  ...  In conjunction with a feasibility study of applying an experimental dictionary and a computer to a proofreading application, investigations into the nature of conversion errors were made and computer programs  ... 
doi:10.1147/sj.82.0172 fatcat:rj76clwdd5donke6yguitvda64

abstracts

1968 IBM Systems Journal  
Our main object here is to present several classes of examples of both analytic and nonanalytic functions where the best approximation can be determined explicitly for all x.  ...  that provides the inputs to the computers consists of analog designs that, over the years, have been developed to a high degree of perfection.  ... 
doi:10.1147/sj.71.0068 fatcat:cgda3idys5by5jdaam47wg6hum

Interpretational abstraction

Gustaf Neumann
1991 Computers and Mathematics with Applications  
Interpretational abstraction enables the software developer to modify and extend the computational meaning of a program.  ...  The instrument of program transformation is used to obtain efficient programs from abstract ones. 65  ...  NEUMANN DIMENSIONS OF ABSTRACTION One of the main issues of programming is the question of how to deal with complexity, how to create suitable building blocks that can be used to represent complex subjects  ... 
doi:10.1016/0898-1221(91)90052-6 fatcat:pqmsvmqgkvftddnssy2qznsqpq

Abstracts

1976 IBM Systems Journal  
Abstracts Listed are abstracts from recent papers and books by IBM authors. Inquiries should be directed to the publications and publishers cited. Are computers ready for the checkless society?, F.  ...  In addition, the graphs can represent functional dependencies in the data base and support inferences and computations that are not explicit in the initial query.  ... 
doi:10.1147/sj.154.0380 fatcat:gxqwtorcujfwjeuyewb62eunvm

Abstracts

1969 College and Research Libraries  
there is sufficient duplication of materials among the libraries to justify use of a jointly operated computer system for record keeping functions; and new techniques and data sources in machine readable  ...  of monographs and in deciding which monographs may be removed from a library's main collection.  ... 
doi:10.5860/crl_30_01_recent_publications fatcat:nyp26pvwtfbyrci5rhurd3fkpi

Program complexity using Hierarchical Abstract Computers

William G. Bail, Marvin V. Zelkowitz
1988 Computer languages  
This complexity measure is based upon the prime program decomposition of a program written for a Hierarchical Abstract Computer.  ...  It is shown that this measure is consistent with the ideas of information hiding and data abstraction.  ...  Acknowledgement--Research on this grant was partially supported by NASA grant NSG-5123 to the University of Maryland.  ... 
doi:10.1016/0096-0551(88)90019-7 fatcat:rxrxmnzihzhu3gehyenzh276rm

Teaching Computational Abstract Algebra

ERICH KALTOFEN
1997 Journal of symbolic computation  
We report on the contents and pedagogy of a course in abstract algebra that was taught with the aid of educational software developed within the Mathematica system.  ...  We describe the topics covered and the didactical use of the corresponding Mathematica packages, as well as draw conclusions for future such courses from the students' comments and our own experience.  ...  Acknowlegdement I would like to express my gratitude to the two unnamed referees, whose suggestions have improved the final version of the paper.  ... 
doi:10.1006/jsco.1996.0104 fatcat:bfxwe7mws5gtzkc2eezs5bfzvy

Abstracts

2005 International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06)  
Abstract Multi-Agent Systems are one of the most prominent and attractive paradigms in computer science at the beginning of the new millennium.  ...  , computer games, education and training, ubiquitous computing, and social simulation.  ...  The talk then dwells upon how to define "intelligence" of man-made machines and continue with a discussion on computational intelligence, its main components and compare it with biological and artificial  ... 
doi:10.1109/cimca.2005.1631435 fatcat:vwiscancinaopiioqazmo3eemy

Abstracts

2005 International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06)  
Abstract Multi-Agent Systems are one of the most prominent and attractive paradigms in computer science at the beginning of the new millennium.  ...  , computer games, education and training, ubiquitous computing, and social simulation.  ...  The talk then dwells upon how to define "intelligence" of man-made machines and continue with a discussion on computational intelligence, its main components and compare it with biological and artificial  ... 
doi:10.1109/cimca.2005.1631232 fatcat:tpc6yjyh75bxjggiwisugest3u

Abstracts

1968 IBM Systems Journal  
Recent ABSTRACTS IBM SYST J t j _— _— w= | years have seen the extension of these techniques to increasingly compre- hensive and detailed models applied to the study of large and complex sys- tems.  ...  Properties of such schedules, such as the degree to which computation can proceed ‘‘in parallel,’’ are characterized.  ... 
doi:10.1147/sj.72.0135 fatcat:kdr7nnidwrcu3egl4jiszmy3zu

PhD Abstracts

GRAHAM HUTTON
2014 Journal of functional programming  
The Journal of Functional Programming would like to change that!  ...  A dissertation is eligible if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. The abstracts are not reviewed.  ...  Less is more: Generic programming theory and practice Abstraction is ubiquitous in computer programming.  ... 
doi:10.1017/s0956796814000215 fatcat:rs2j5wgm5ndf7ek2zls5pmg2w4

Abstraction abstracted

Russ Abbott, Chengyu Sun
2008 Proceedings of the 2nd international workshop on The role of abstraction in software engineering - ROA '08  
An abstraction is the reification of and conceptualization of a distinction. We use the process of forming abstractions to make sense of the world, i.e., to form concepts.  ...  We can teach the use of pre-packaged abstractions. It is more difficult to teach the self-awareness necessary for inventing new abstractions. The process of building abstractions is bottom-up.  ...  The irresistible beauty of programming consists in the reduction of complex formal processes to a very small set of primitive operations.  ... 
doi:10.1145/1370164.1370171 fatcat:2775m7jphnh25f7sfnj6dkjema

Neural Abstract Reasoner [article]

Victor Kolev, Bogdan Georgiev, Svetlin Penkov
2020 arXiv   pre-print
We introduce the Neural Abstract Reasoner (NAR), a memory augmented architecture capable of learning and using abstract rules.  ...  We provide some intuition for the effects of spectral regularization in the domain of abstract reasoning based on theoretical generalization bounds and Solomonoff's theory of inductive inference.  ...  complexity of a given function/program.  ... 
arXiv:2011.09860v1 fatcat:6ayeada5hvg27d37d3jvzoj6le

GUBS Upper Bound Solver (Extended Abstract)

Martin Avanzini, Michael Schaper
2017 Electronic Proceedings in Theoretical Computer Science  
GUBS now forms the backbone of HoSA, a tool for analysing space and time complexity of higher-order functional programs automatically.  ...  In this extended abstract we present the GUBS Upper Bound Solver.  ...  Term rewriting systems (TRSs for short) provide an abstract model of computation that is at the heart of functional and declarative programming.  ... 
doi:10.4204/eptcs.248.6 fatcat:jfdsl4gdqnbcvg64oboggem5wq

Abstract computational complexity and cycling computations

Giorgio Ausiello
1971 Journal of computer and system sciences (Print)  
Computational Complexity and Cycling GIORGIO AUSIELLO lstituto per le Applicazioni del Calcolo* del Consiglio Nazionale delle Ricerche, Italy A weakening of Blum's Axioms for abstract computational complexity  ...  How the new axioms affect the theory and how they can be used to get an insight in the theory of computations using a finite amount of resource, is shown.  ...  INTRODUCTION The theory of abstract computational complexity is based on the axiomatization of the notion of amount of resource (time, tape, ink, etc.) required to perform a given computation on an abstract  ... 
doi:10.1016/s0022-0000(71)80030-2 fatcat:qzpt6va42jasbkfadva2ezsdyq
« Previous Showing results 1 — 15 out of 254,652 results