نتایج جستجو برای: computer arithmetic

تعداد نتایج: 605402  

Journal: :Educational Technology & Society 2014
Vagner Beserra Miguel Nussbaum Ricardo Zeni Werner Rodriguez Gabriel Wurman

Studies show the positive effects that video games can have on student performance and attitude towards learning. In the past few years, strategies have been generated to optimize the use of technological resources with the aim of facilitating widespread adoption of technology in the classroom. Given its low acquisition and maintenance costs, the interpersonal computer allows individual interac...

2002
Franky Backeljauw Annie Cuyt Johan Vervloet

Using the approach in [2, 4, 5], interval bounds for values in R or R∪ [−∞, +∞], which is what one is interested in in most industrial applications, can be computed. These approaches, however, do not in all cases reflect all that is known about the interval valued expressions, as is required during prototyping or in a computer algebra environment. A similar remark holds for the complex arithmet...

Journal: :IEEE Trans. Computers 2017
Javier Hormigo Jean-Michel Muller Stuart F. Oberman Nathalie Revol Arnaud Tisserand Julio Villalba

intensive numerical simulations use floating-point arithmetic operations, and elementary functions such as logarithm or cosine. Gaining speed and accuracy is tantamount in these applications; cryptographic applications use totally different calculations–but it is still a matter of arithmetic!–, to allow one to efficiently play with elliptic curves, integer lattices, and similar discrete structu...

Journal: :CoRR 2011
Shlomi Dolev Sergey Frenkel Dan E. Tamir

The traditional approach to fault tolerant computing involves replicating computation units and applying a majority vote operation on individual result bits. This approach, however, has several limitations; the most severe is the resource requirement. This paper presents a new method for fault tolerant computing where for a given error rate, , the hamming distance between correct inputs and fau...

2009

Floating-point arithmetic is considered an esoteric subject by many people. This is rather surprising because floating-point is ubiquitous in computer systems. Almost every language has a floating-point datatype; computers from PCs to supercomputers have floating-point accelerators; most compilers will be called upon to compile floating-point algorithms from time to time; and virtually every op...

Journal: :CoRR 2001
Sylvie Boldo Marc Daumas Claire Moreau-Finot Laurent Théry

Most existing implementations ofmultiple precision arithmetic demand that the user sets the precision a priori. Some libraries are said adaptable in the sense that they dynamically change the precision of each intermediate operation individually to deliver the target accuracy according to the actual inputs. We present in this text a new adaptable numeric core inspired both from floating point e...

2009
Ünal Çakiroglu

Understanding is one of the most important research areas of Natural Language Processing. Problem solving is a way of realizing machine understanding. This paper presents a problem solver system which can understand and solve arithmetic problems in Turkish. There are three main phases of the system: morphology, syntax and semantic. The difference from other systems that is; data modeled as sema...

2007
Ulrich Kulisch

The IEEE standards 754 and 854 for floating-point arithmetic have been under revision for some time. The work is pushed forward by the Floating-Point Working Group (ca. 100 scientists) of the Standards Committee of the IEEE Computer Society. The group meets monthly near Palo Alto/San Jose in California. At present Dec. 2006 is the deadline for the new standard. The author has tried to influence...

2003
JAMES A. ANDERSON

This article discusses the properties of a controllable, flexible, hybrid parallel computing architecture that potentially merges pattern recognition and arithmetic. Humans perform integer arithmetic in a fundamentally different way than logic-based computers. Even though the human approach to arithmetic is both slow and inaccurate it can have substantial advantages when useful approximations (...

2018
Armin Biere Manuel Kauers Daniela Ritirc

Verifying arithmetic circuits is an important problem which still requires considerable manual effort. For instance multipliers are considered difficult to verify. The currently most effective approach for arithmetic circuit verification uses computer algebra. In this approach the circuit is modeled as a set of pseudo-boolean polynomials and it is checked if the given word-level specification i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید