Citations with the tag: COMPUTER algorithms

Results 1 - 50

• Solving polynomials with computers.
  Pan, Victor Y. // American Scientist; Jan/Feb98, Vol. 86 Issue 1, p62 

  Discusses how computer algorithms provide answers to mathematical problems. Inverse kinetic problem; Shoulder-angle equation; Problem in solving polynomials; Illustration of Gauss's proof of the fundamental theorem of algebra; Iterative algorithms in solving polynomial equations; Bit...

• The computation of global optima in dual response systems.
  del Castillo, Enrique; Fan, Shu-Kai // Journal of Quality Technology; Jul97, Vol. 29 Issue 3, p347 

  Presents an ANSI FORTRAN implementation of the DRSALG algorithm for the computation of global optima in dual response systems (DRS). Importance of the DRSALG algorithm computational method; Illustration of the computer program; Comparison of DRSALG with other methods.

• Date 2000: A practical guide.
  Barnes, Roger // Management Accounting: Magazine for Chartered Management Account; Dec96, Vol. 74 Issue 11, p38 

  Offers some advice to corporate managers to understand the problem on the effect of the millennium change on computer algorithm. Lack of a universal standard on the entry of dates into computer programs; Need for a compliance manager; Audit of all computer and telecommunications hardware and...

• Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program.
  Chinneck, John W. // INFORMS Journal on Computing; Spring97, Vol. 9 Issue 2, p164 

  Presents a study that addressed the problem of finding irreducible inconsistent systems (IIS). Review of the theory and history of isolation of IIS; Filtering algorithms for isolating IIS; Results and discussion.

• An Automatic Approach to Deadlock Detection and Resolution in Discrete Simulation Systems.
  Deuermeyer, Bryan L.; Curry, Guy L.; Duchowski, Andrew T.; Venkatesh, Srilakshmi // INFORMS Journal on Computing; Spring97, Vol. 9 Issue 2, p195 

  Presents information on a study that developed an automatic deadlock detection scheme for general purpose simulation systems and offered deadlock-resolution algorithms for grouped resources and overlapping resources. Definition of the deadlock situation; Deadlock characterization and detection;...

• On Formal Semantics and Analysis of Typed Modeling Languages: An Analysis of Ascend.
  Bhargava, Hemant K.; Krishnan, Ramayya; Piela, Peter // INFORMS Journal on Computing; Spring98, Vol. 10 Issue 2, p189 

  Analyzes the use of Ascend modeling language for mathematical modeling. Significance of the modeling language in improving the functionality of computer-based modeling environments; Provision of operators for dynamic type inference; Development of formal semantics for the type system in Ascend;...

• Statistical Analysis of Computational Tests of Algorithms and Heuristics.
  Coffin, Marie; Saltzman, Matthew J. // INFORMS Journal on Computing; Winter2000, Vol. 12 Issue 1, p24 

  Statistical analysis is a powerful tool to apply when evaluating the performance of computer implementations of algorithms and heuristics. Yet many computational studies in the literature do not use this tool to maximum effectiveness. This paper examines the types of data that arise in...

• New formula will improve outcome in the annual resident match.
  Sweeney, Rosemarie; Rose, Verna L. // American Family Physician; 8/1/97, Vol. 56 Issue 2, p339 

  Presents a report from the Primary Care Weekly on the institution of a change in the computer algorithm used to select matches in the National Resident Matching Program (NRMP) in 1998. Advantages of the change in computer algorithm to the medical students.

• Quantum information and computation.
  Bennett, Charles H. // Physics Today; Oct95, Vol. 48 Issue 10, p24 

  Focuses on the emerging quantum theory of communication and computation, in which the stuff transmitted is not classical information but arbitrary superpositions of quantum states. Fundamental properties of quantum systems; Nature of quantum information processing; Quantum data compression; Fast...

• Network Reoptimization Algorithms: A Statistically Designed Comparison.
  Bennett, Charles H. // ORSA Journal on Computing; Fall93, Vol. 5 Issue 4, p395 

  Statistical design and analysis of experiments is a cornerstone methodology for scientific exploration and verification that is rarely employed in reporting mathematical software testing This approach is used to study the relative effectiveness of three key algorithms for the reoptimization of...

• Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.
  Courcelle, B.; Makowsky, J. A.; Rotics, U. // Theory of Computing Systems; Mar/Apr2000, Vol. 33 Issue 2, p125 

  Discusses the development of applications for graphs of clique-width and cographs. Theorems; Graph presentations for logically oriented work; Linear algorithms for optimization problems on P[sub 4]-sparse graphs.

• Accelerating high-speed encryption: one bottleneck after another.
  Cravotta, Nicholas // EDN Europe; Sep2001, Vol. 46 Issue 9, p37 

  Focuses on the challenges in accelerating cryptographic functions. Algorithms used for security systems; Difference between electronic commerce and virtual private network applications; Steps in justifying the cost of a cryptographic accelerator. INSETS: SYSTEM-STALL POINTS;THE TRUTH ABOUT...

• Develop Custom Control Applications.
  Cravotta, Nicholas // Instrumentation Newsletter; 2002 3rd Quarter, Vol. 14 Issue 3, p20 

  Focuses on the addition of control algorithms for software development system. Introduction of the LabVIEW PID Control Toolset of National Instruments Corp.; Optimization of real-time control; Evaluation of PID performance.

• Computation of Nash equilibria in finite games: introduction to the symposium.
  Stengel, Bernhard // Economic Theory; Jan2010, Vol. 42 Issue 1, p1 

  An introduction to the journal is presented in which the editor discusses an article on the methods of solving all equilibria of a two-player game strategic form by David Avis and colleagues, the computational methods based on computer algebra that find Nash equilibria of a game by Ruchira...

• Proteomics: To Spray or Not to Spray.
  Jonscher, Karen // Genomics & Proteomics; Jul/Aug2003, Vol. 3 Issue 6, p31 

  Focuses on the identification of proteins by computer search algorithms. Validity of a sequence assignments; Effort to eliminate database redundancy in proteomics; Methods in detecting fragment ions.

• The Elliptic Curve Digital Signature Algorithm (ECDSA).
  Johnson, Don; Menezes, Alfred; Vanstone, Scott // International Journal of Information Security; 2001, Vol. 1 Issue 1, p36 

  The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). It was accepted in 1999 as an ANSI standard and in 2000 as IEEE and NIST standards. It was also accepted in 1998 as an ISO standard and is under consideration for...

• Quick reviews.
  Johnson, Don; Menezes, Alfred; Vanstone, Scott // Electronic Design; 6/13/94, Vol. 42 Issue 12, p109 

  Reviews the book `Computer Algorithms: String Pattern Matching Strategies,' edited by Jun-ichi Aoe.

• Special Issue on Measurement Based Network Management.
  Baek-Young Choi; Zhenhai Duan; Sue Moon // Journal of Network & Systems Management; Mar2011, Vol. 19 Issue 1, p3 

  The article discusses various reports published within the issue, including one on the admission control for multimedia services, one on the performance of the oblivious routing algorithms, and one on the strengths and limitations of global iceberg in distributed streams.

• GUEST EDITORIAL: THEORETICAL INVESTIGATION OF DEPENDABLE COMPUTING.
  Tingyao Jiang; Dong Ren; Yang, Simon X. // Intelligent Automation & Soft Computing; Aug2011, Vol. 17 Issue 5, p493 

  An introduction is presented in which the editor discusses various reports published within the issue on topics including blotch identification algorithm for archive film restoration, adaptive algorithm with automatic estimation, and selection method for winter wheat yellow rust detection.

• x-cellent.
  Robertson, Barbara // Computer Graphics World; Jul2003, Vol. 26 Issue 7, p32 

  Opening to a record-breaking box office of $155 million internationally in its first weekend, 20th Century Fox's X2, X-men United gave the summer movie season a welcome kick-start. The effects shots in X2 are driven by an ensemble cast of superheroes. These X-Men are mutants, outcasts feared and...

• ACM/Springer Mobile Networks and Applications (MONET) Special Issue on �Recent Advances in IEEE 802.11 WLANs: Protocols, Solutions and Future Directions�.
  Chatzimisios, Periklis; Xiao, Yang; Tinnirello, Ilenia; Granelli, Fabrizio; Elmallah, Ehab // Mobile Networks & Applications; Dec2009, Vol. 14 Issue 6, p693 

  The article discusses various reports published within the issue, including one by Patras and colleagues on a control theoretic approach to adapt the congestion window (CW) to the conditions of the wireless local area network (WLAN), one by Kartsakli and colleagues on four scheduling algorithms...

• Use the FREQUENCY function to create histograms that update with your data.
  Kavanagh, Sean // Inside Microsoft Excel; Mar2010, Vol. 17 Issue 3, p5 

  The article offers step-by-step instructions on how to create a frequency distribution table with worksheet functions using a FREQUENCY formula.

• Analyses of Load Stealing Models Based on Families of Differential Equations.
  Mitzenmacher, M. // Theory of Computing Systems; 2001, Vol. 34 Issue 1, p77 

  In this paper we analyze the limiting behavior of several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the number of processors grows to infinity using differential equations. The advantages of this approach include the...

• VIDEO COMPRESSION SLIMS DOWN FOR SPRING.
  Dipert, Brian // EDN; 4/4/2002, Vol. 47 Issue 7, p59 

  Reports on video compression slimming down for spring. Consideration on un-compressed-video bit rates; Emission link between sender and recepient; Selection between video-compression and decompression algorithms; Product features.

• The Characterization of Data-Accumulating Algorithms.
  Bruda, S. D.; Akl, S. G. // Theory of Computing Systems; Jan/Feb2000, Vol. 33 Issue 1, p85 

  Discusses the characteristics of data-accumulating algorithms (d-algorithms). Preliminaries concerning the data-accumulating paradigm; Similarity of d-algorithms with on-line algorithms; Influence of parallel implementation of the performance of d-algorithms; List scanning problem associated...

• Guest Editorial.
  Aziz, Syed Mahfuzul; Asari, Vijayan K.; Hossain, M. Alamgir; Karim, Mohammad A.; Milanova, Mariofanna // Journal of Computers; Jan2010, Vol. 5 Issue 1, p1 

  The article discusses various reports published within the issue, including one by S. I. Ahmed, M. A. Islam, and M. Hasan on algorithms for efficiently cutting small polygonal objects, one by R. Shams, A. Elsayed, and Q. M. Akteron on the evaluation of domain-specific Text to Knowledge Mapping...

• ALPO: Another Linear Program Optimizer.
  Vanderbei, Robert J. // ORSA Journal on Computing; Spring93, Vol. 5 Issue 2, p134 

  This paper describes an implementation of the one-phase primal-dual path-following algorithm for solving linear programming problems. The design is intended to be simple, portable and robust. These design goals are achieved without sacrificing state-of-the-art performance. We give a rather...

• An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming.
  Cook, William; Rutherford, Thomas; Scarf, Herbert E.; Shallcross, David // ORSA Journal on Computing; Spring93, Vol. 5 Issue 2, p206 

  Focuses on the implementation of the generalized basis reduction algorithm for integer programming. Development of an algorithm with running time in the theory of integer programming; Discussion on the polynomial substitution in the mathematical setting; Use of a nonzero integral vector for...

• Foreword.
  Gavoille, Cyril; Patt-Shamir, Boaz; Scheideler, Christian // Theory of Computing Systems; Nov2010, Vol. 47 Issue 4, p809 

  The article discusses various papers published within the issue including "Distributed Approximation of Capacitated Dominating Sets," "Strong-Diameter Decompositions of Minor Free Graphs" and "Approximation Algorithms for Multiprocessor Scheduling under Uncertainty."

• Communications.
  Buffa, Elwood S.; Scriabin, Michael; Vergin, Roger C. // Management Science; Sep76, Vol. 23 Issue 1, p104 

  A letter to the editor is presented in response to the article "Comparison of Computer Algorithms and Visual Based Methods for Plant Layout,' by Michael Scribian and Roger C. Vergin in the October 1975 issue. A response from Scribian and Vergin is included.

• The Voronoi Partition of a Network and its Implications in Location Theory.
  Hakimi, S. Louis; Labbe, Martine; Schmeichel, Edward // ORSA Journal on Computing; Fall92, Vol. 4 Issue 4, p412 

  Given a network N(V, E) and a set of points X[sub p] = {x[sub 1],...,x[sub p]} on N, we first present an algorithm for computing the Voronoi partition of N(V,E) into territories T(x[sub 1]),..., T(x[sub p]). After describing two ways to measure the "size" of a territory, we introduce and discuss...

• Efficient Algorithms for the Capacitated 1-Median Problem.
  Elgindy, Hossam; Keil, J. Mark // ORSA Journal on Computing; Fall92, Vol. 4 Issue 4, p418 

  The 1-median problem is to locate a service facility so as to minimize the sum of the distances from a given set of demand destinations. In this paper, we develop a data storage scheme which is useful for dealing with sums of rectilinear (L[sub 1]) distances in space and travel distances along...

• Development of a computer algorithm for the detection of phase singularities and initial application to analyze simulations of atrial fibrillation.
  Zou, Renqiang; Kneller, James; Leon, L. Joshua; Nattel, Stanley // Chaos; Sep2002, Vol. 12 Issue 3, p764 

  Atrial fibrillation (AF) is a common cardiac arrhythmia, but its mechanisms are incompletely understood. The identification of phase singularities (PSs) has been used to define spiral waves involved in maintaining the arrhythmia, as well as daughter wavelets. In the past, PSs have often been...

• A New View on Volumes.
  Mahoney, Diana Phillips // Computer Graphics World; Feb2000, Vol. 23 Issue 2, p18 

  Reports that researchers at the Vienna University of Technology in Austria have developed a rendering technique for the fast display of isosurfaces of directly rendered volume data on computers. Advantage and disadvantage of direct volume rendering; Creation of an algorithm that identifies and...

• Efficient E-Discovery.
  Grossman, Maura R. // ABA Journal; Apr2012, Vol. 98 Issue 4, p31 

  The article presents information on the technology-assisted document review using computer algorithms that can increase speed and efficiency by 50 percent than manual reviewing.

• Guest Editorial.
  Grossman, Maura R. // Journal of Computers; Apr2010, Vol. 5 Issue 4, p489 

  The article discusses various reports published within the issue, including one by Zhang Shu-Kui and colleagues on the aggregation algorithm for wireless sensor networks, one by Zhihong Li and colleagues on the organizational climate's influence on knowledge-sharing in information technology...

• Mobile and Ubiquitous Multimedia.
  Angelides, Marios // Multimedia Systems; Feb2012, Vol. 18 Issue 1, p1 

  An introduction is presented in which the editor discusses various reports within the issue on topics including computer algorithms, social media and media management.

• Introduction to the Special Issue on the 18th International Symposium on Computer Architecture and High Performance Computing.
  Souza, Alberto; Buyya, Rajkumar // International Journal of Parallel Programming; Apr2008, Vol. 36 Issue 2, p163 

  The article discusses various reports published within the issue, including one on a dual-thread speculation system and another on a parallel version of the Tricluster algorithm.

• An Alternative to the Graham–Glanville Code-Generation Method.
  Horspool, R. Nigel // IEEE Software; May87, Vol. 4 Issue 3, p33 

  Focuses on the advantages of the code-generation algorithm approach in compiler technology. Analysis of the machine grammar to avoid potential block; Generation of possible parses; Assessment of the attribute values.

• From Point Clouds to Power Crusts.
  Mahoney, Diana Phillips // Computer Graphics World; Jun2001, Vol. 24 Issue 6, p14 

  Features Power Crust, an algorithm on the reconstruction of polygonal surfaces from three dimensional scan data. Functions of the Power Crust; Basis of the Power Crust technique; Advantages of Power Crust; Development of enhancements to the Power Crust technique.

• RF-simulation algrithms: Which one is better for IC design?
  Singh, Raminderpal; Dickey, Carl; Keene, Mike // EDN; 8/22/2002, Vol. 47 Issue 18, p83 

  Focuses on the accuracy and efficiency of radio frequency simulation algorithms. Strengths of periodic steady state algorithms; Increase in the demand for simulators; Suitability of harmonic-balance simulation suits in RF circuits.

• Tool shows the power of integration.
  Moretti, Gabe // EDN; 3/6/2003, Vol. 48 Issue 5, p22 

  Focuses on the design of analog-development tools. Lack of integration in the digital-design flow in NeoCell tool; Features of the improved Neocell Version 3.2; Adherence of algorithms to analog-constraint requirements.

• Feynman-diagram evaluation in the electroweak theory with computer algebra.
  Weiglein, G. // AIP Conference Proceedings; 2001, Vol. 583 Issue 1, p45 

  The evaluation of quantum corrections in the theory of the electroweak and strong interactions via higher-order Feynman diagrams requires complicated and laborious calculations, which however can be structured in a strictly algorithmic way. These calculations are ideally suited for the...

• Artificial Intelligence for Computer Games.
  El Rhalibi, Abdennour; Kok Wai Wong; Price, Marc // International Journal of Computer Games Technology; 2009, p1 

  An introduction to the journal is presented in which the editor discusses the article on design of moving target search (MTS) algorithms for computer generated bots by Peter Kok Keong Loh, the formal framework for shortest-path decision process problem representation by Julio Clempner, and the...

• Algorithm tests for point location.
  Arendt, Lawrence // EDN; 08/03/2000, Vol. 45 Issue 16, p126 

  Focuses on algorithm tests for point location. Necessity to determine the particular operating points of the attractor; Approximation of the phase-space trajectory of a dynamic system using several nonoverlapping triangles; Importance of determining the point of a circle or triangle.

• Matrix Balancing on a Massively Parallel Connection Machine.
  Zenios, Stavros A. // ORSA Journal on Computing; Spring90, Vol. 2 Issue 2, p112 

  Matrix balancing models find applications in economics, transportation, regional sciences, statistics, stochastic modeling and other areas. The iterative scaling algorithm RAS that is used for the solution of these problems is shown here to be suitable for data level parallelism on the...

• Empirical Studies on the Average Efficiency of Simplex Variants under Rotation Symmetry.
  Borgwardt, Karl Heinz; Damm, Renate; Donig, Rudolf; Joas, Gabriele // ORSA Journal on Computing; Summer93, Vol. 5 Issue 3, p249 

  In this paper we study the average number of pivot steps required by the simplex algorithm for solving linear programs. For this purpose we perform numerical end empirical tests. The problems are generated randomly according to several rotation symmetric distribution models. We observe the...

• Semiotic and discursive variables in cas-based didactical engineering.
  Winsl�w, Carl // Educational Studies in Mathematics; 2003, Vol. 52 Issue 3, p271 

  This paper presents a semiotic analysis of the (often claimed) potential of computer algebra systems (CAS) for enabling mathematical activity on a conceptual level higher than usual. Theoretical points are illustrated by examples from a development project in the context of a first year...

• Observation of electronic shell structure in large cesium oxide clusters.
  Bergmann, T.; Martin, T. P. // Journal of Chemical Physics; 3/15/89, Vol. 90 Issue 6, p2848 

  Photoionization spectra of CsnOx clusters have been recorded for 15=n=130 and 1=x=10. We present a method of interpreting these spectra and a computer algorithm for their evaluation. Several features of these photoionization spectra support the spherical-jellium-background model.

• Guest Editorial.
  Miorandi, Daniele; M�dard, Muriel // Mobile Networks & Applications; Apr2011, Vol. 16 Issue 2, p214 

  An introduction to the journal is presented in which the editor discusses various reports published within the issue including one by S. Borst and Y. Al-Harthi on "Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access," one by W. Saad and colleagues on the game-theoretical...

Next 50 Results