• 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 42,700
Next 10 →

4th IEEE International Symposium on Electronic Design, Test & Applications High Performance FPGA implementation of the Mersenne Twister

by Shrutisagar Ch, Abbes Amira
"... Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twister is presented. The proposed architecture has the smallest footprint of all published architectures to date and occupies ..."
Abstract - Add to MetaCart
Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twister is presented. The proposed architecture has the smallest footprint of all published architectures to date and occupies

FPGA Implementations of Tiny Mersenne Twister

by Guoping Wang
"... Random number generators are essential in many computing applications, such as Artificial Intelligence like genetic algorithms and automated opponents, random game content, simulation of complex phenomena such as weather and fire, numerical methods such as Monte-Carlo integration, cryptography algor ..."
Abstract - Add to MetaCart
Random number generators are essential in many computing applications, such as Artificial Intelligence like genetic algorithms and automated opponents, random game content, simulation of complex phenomena such as weather and fire, numerical methods such as Monte-Carlo integration, cryptography algorithms such as RSA use random numbers for key generation, digital signal processing and communications, etc. Pseudo-random Number Generators (PRNGs) generate a sequence of “random ” numbers using an algorithm, operating on an internal state,

Variants of Mersenne Twister Suitable for Graphic Processors

by Mutsuo Saito - ACM Trans. on Math. Softw , 2013
"... ar ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
Abstract not found

The Cricket Location-Support System

by Nissanka B. Priyantha, Anit Chakraborty, Hari Balakrishnan , 2000
"... This paper presents the design, implementation, and evaluation of Cricket, a location-support system for in-building, mobile, locationdependent applications. It allows applications running on mobile and static nodes to learn their physical location by using listeners that hear and analyze informatio ..."
Abstract - Cited by 1036 (11 self) - Add to MetaCart
This paper presents the design, implementation, and evaluation of Cricket, a location-support system for in-building, mobile, locationdependent applications. It allows applications running on mobile and static nodes to learn their physical location by using listeners that hear and analyze

Genetic Programming

by John R. Koza , 1997
"... Introduction Genetic programming is a domain-independent problem-solving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring ..."
Abstract - Cited by 1051 (12 self) - Add to MetaCart
Introduction Genetic programming is a domain-independent problem-solving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring genetic operations such as crossover (sexual recombination) and mutation. John Holland's pioneering Adaptation in Natural and Artificial Systems (1975) described how an analog of the evolutionary process can be applied to solving mathematical problems and engineering optimization problems using what is now called the genetic algorithm (GA). The genetic algorithm attempts to find a good (or best) solution to the problem by genetically breeding a population of individuals over a series of generations. In the genetic algorithm, each individual in the population represents a candidate solut

Wireless sensor networks: a survey

by I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci , 2002
"... This paper describes the concept of sensor networks which has been made viable by the convergence of microelectro-mechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review of fact ..."
Abstract - Cited by 1936 (23 self) - Add to MetaCart
This paper describes the concept of sensor networks which has been made viable by the convergence of microelectro-mechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review of factors influencing the design of sensor networks is provided. Then, the communication architecture for sensor networks is outlined, and the algorithms and protocols developed for each layer in the literature are explored. Open research issues for the realization of sensor networks are

Usability Analysis of Visual Programming Environments: a `cognitive dimensions' framework

by T. R. G. Green, M. Petre - JOURNAL OF VISUAL LANGUAGES AND COMPUTING , 1996
"... The cognitive dimensions framework is a broad-brush evaluation technique for interactive devices and for non-interactive notations. It sets out a small vocabulary of terms designed to capture the cognitively-relevant aspects of structure, and shows how they can be traded off against each other. T ..."
Abstract - Cited by 510 (13 self) - Add to MetaCart
The cognitive dimensions framework is a broad-brush evaluation technique for interactive devices and for non-interactive notations. It sets out a small vocabulary of terms designed to capture the cognitively-relevant aspects of structure, and shows how they can be traded off against each other. The purpose of this paper is to propose the framework as an evaluation technique for visual programming environments. We apply it to two commercially-available dataflow languages (with further examples from other systems) and conclude that it is effective and insightful; other HCI-based evaluation techniques focus on different aspects and would make good complements. Insofar as the examples we used are representative, current VPLs are successful in achieving a good `closeness of match', but designers need to consider the `viscosity' (resistance to local change) and the `secondary notation' (possibility of conveying extra meaning by choice of layout, colour, etc.).

Planning Algorithms

by Steven M LaValle , 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract - Cited by 1108 (51 self) - Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensor-based planning, visibility, decision-theoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.

Knowledge representations, reasoning and declarative problem solving . . .

by Chitta Baral , 2001
"... ..."
Abstract - Cited by 714 (43 self) - Add to MetaCart
Abstract not found

The Landscape of Parallel Computing Research: A View from Berkeley

by Krste Asanovic, Ras Bodik, Bryan Christopher Catanzaro, Joseph James Gebis, Parry Husbands, Kurt Keutzer, David A. Patterson, William Lester Plishker, John Shalf, Samuel Webb Williams, Katherine A. Yelick - TECHNICAL REPORT, UC BERKELEY , 2006
"... ..."
Abstract - Cited by 468 (25 self) - Add to MetaCart
Abstract not found
Next 10 →
Results 1 - 10 of 42,700
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