Filters








4,418,698 Hits in 5.0 sec

On computing power [chapter]

Jean E. Vuillemin
1994 Lecture Notes in Computer Science  
We try both general purpose computer architectures (single and multi processors, Simd and Mimd), and special purpose electronics (full-custom, gate-array, FPGA) on the problem.  ...  All measures are expressed in a single common unit for computing power: the Gbops 1 . It applies to all forms of digital processors, and across technologies.  ...  power is near one.  ... 
doi:10.1007/3-540-57840-4_25 fatcat:xjcos3usxvdmli65bp4vh7xp4m

Power Aware Computing on GPUs

Kiran Kasichayanula, Dan Terpstra, Piotr Luszczek, Stan Tomov, Shirley Moore, Gregory D. Peterson
2012 2012 Symposium on Application Accelerators in High Performance Computing  
Energy and power density concerns in modern processors have led to significant computer architecture research efforts in power-aware and temperature-aware computing.  ...  power tradeoffs of one component versus another using microbenchmarks.  ...  The impact on CPU computations while spawning Pthreads to measure power using NVML is small as frequency is not very high.  ... 
doi:10.1109/saahpc.2012.26 fatcat:gvf4cnjfcnhu7krxgtpydkuvfa

On the Universal Computing Power of Amorphous Computing Systems

Jiří Wiedermann, Lukáš Petrů
2009 Theory of Computing Systems  
We show that under reasonable probabilistic assumptions such amorphous computing systems can possess universal computing power with a high probability.  ...  We consider a model whose assumptions on the underlying computing and communication abilities are among the weakest possible: all computational units are finite state probabilistic automata working asynchronously  ...  Simulation We show the universal computing power of on AC by letting it simulate a unit-cost RAM.  ... 
doi:10.1007/s00224-009-9178-6 fatcat:t6z4jhmoq5ddvaapaflquedfnu

On the Computing Power of +, -, and × [article]

Marcello Mamino
2014 arXiv   pre-print
How does this class depend on B? We prove that it is always contained in the class obtained for B = {+, -, ×}.  ...  Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set B of real functions semialgebraic over the rationals.  ...  INTRODUCTION In this work, we study the power of computation over the real numbers to decide classical Boolean problems.  ... 
arXiv:1401.4879v2 fatcat:h5ugci3455ddpavh646gbybcme

On the Power of DNA-Computing

Diana Rooß, Klaus W. Wagner
1996 Information and Computation  
Various modifications of Lipton's model, based on other DNA manipulations, are investigated systematically, and it is proved that their computational power in polynomial time can be characterized by one  ...  of the power of this kind of computing.  ...  It seems that the computational power of the set operations strongly depends on the possession of certain crucial properties.  ... 
doi:10.1006/inco.1996.0094 fatcat:pc2co7xu55ewfdndhmt35vykrq

On the computational power of DNA

Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jir̆í Sgall
1996 Discrete Applied Mathematics  
We show how DNA-based computers can be used to solve the satisfiability problem for boolean circuits.  ...  Furthermore, we show how DNA computers can solve optimization problems directly without first solving several decision problems. Our methods also enable random sampling of satisfying assignments.  ...  Our second goal is to present a standard framework and survey the many results and claims about the computational power of DNA.  ... 
doi:10.1016/s0166-218x(96)00058-3 fatcat:dosq2tnxpnf5pifyspijgcigr4

On the computational power of BlenX

Alessandro Romanel, Corrado Priami
2010 Theoretical Computer Science  
With BlenX such a reaction can be modeled in different ways, one of which is sketched in Fig. 1 .  ...  Priami / Theoretical Computer Science 411 (2010) 542-565 Table 1 Definition of free names for bio-processes and processes. fn(Nil) = fn(nil) = fn(β(x, ∆)) = fn(β(x, ∆)I) = ∅ fn(I[P]) = fn(P) \ sub(I) fn  ...  Conclusion In this paper we investigated the computational power of the nondeterministic version of BlenX, a language based on Beta-binders.  ... 
doi:10.1016/j.tcs.2009.09.038 fatcat:ve5wow54hzcdlfnqb7tfzdivze

On the power of quantum computation

1998 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
The quantum model of computation is a model, analogous to the probabilistic Turing machine (PTM), in which the normal laws of chance are replaced by those obeyed by particles on a quantum mechanical scale  ...  We thus offer compelling evidence that the quantum model may have significantly more complexity theoretic power than the PTM.  ...  on a traditional computer.  ... 
doi:10.1098/rsta.1998.0247 fatcat:3rbsxrm7bravhfr5wfkfcv3roa

On the Power of Quantum Computation

Daniel R. Simon
1997 SIAM journal on computing (Print)  
The quantum model of computation is a model, analogous to the probabilistic Turing machine (PTM), in which the normal laws of chance are replaced by those obeyed by particles on a quantum mechanical scale  ...  We thus offer compelling evidence that the quantum model may have significantly more complexity theoretic power than the PTM.  ...  on a traditional computer.  ... 
doi:10.1137/s0097539796298637 fatcat:pxbi3xnqwzhhfa5k6dodignwr4

On the Power of Interactive Computing [chapter]

Jan van Leeuwen, Jiří Wiedermann
2000 Lecture Notes in Computer Science  
In a number of recent studies the question has arisen whether the familiar Church-Turing thesis is still adequate to capture the powers and limitations of modern computational systems.  ...  In this presentation we review two developments that may lead to an extension of the classical Turing machine paradigm: interactiveness, and global computing.  ...  This gives a computational power more akin to that of various 'non-uniform' computational models (cf. [1] ), implying a power beyond that of ordinary Turing machines.  ... 
doi:10.1007/3-540-44929-9_48 fatcat:eni6aksnsbbr5n5ok7s7jvsxta

On the computational power of oblivious robots

Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita
2010 Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10  
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane.  ...  This brings to the front the natural research question: what are the real computational limits imposed by the robots being oblivious?  ...  The studies on the computational power of systems of oblivious robots have focused on determining what minimal capabilities are necessary so that the robots can perform simple basic tasks e.g. gathering  ... 
doi:10.1145/1835698.1835761 dblp:conf/podc/DasFSY10 fatcat:gdqmz4xkyjbcdpwlhbffvjtv6a

On Computational Power of Quantum Branching Programs [chapter]

Farid Ablayev, Aida Gainutdinova, Marek Karpinski
2001 Lecture Notes in Computer Science  
In this paper we study a model of Quantum Branching Program (QBP) and investigate its computational power.  ...  Further we display certain symmetric Boolean function which is computable by a read-once QBP with O(log n) width, which requires a width Ω(n) on any deterministic read-once BP and (classical) randomized  ...  Leveled oblivious permutation BPs are well known in the complexity theory, their computational power is remarkable (deterministic leveled oblivious permutation BPs with constant width have the same power  ... 
doi:10.1007/3-540-44669-9_8 fatcat:ps2dy7oagrcitahfy3tynjocu4

On Computational Power of Quantum Branching Programs [article]

Farid Ablayev, Aida Gainutdinova, Marek Karpinski
2003 arXiv   pre-print
In this paper we study a model of a Quantum Branching Program (QBP) and investigate its computational power.  ...  We prove a general lower bound on the width of read-once QBPs, which we show to be almost tight on certain symmetric function.  ...  Leveled oblivious permutation BPs are well known in the complexity theory, their computational power is remarkable (deterministic leveled oblivious permutation BPs with constant width have the same power  ... 
arXiv:quant-ph/0302022v1 fatcat:g2jgysru2jfnlgmgyppjvmisrq

On the Computational Power of Simple Dynamics

Emanuele Natale
2018 Bulletin of the European Association for Theoretical Computer Science  
scientists: In mathematics and theoretical computer science, the study of basic algorithmic processes on very simple distributed systems can be traced back to the study of cellular automata and Conway's  ...  Informally, dynamics are rules to update an agent's state according to a function which 1 According to certain historical perspectives, one could rather talk about a recent revival of attention from computer  ...  Besides its significance as a proof of concept for the computational power of simple dynamics, from a spectral graph theory perspective, this work improves the state of the art on distributed spectral  ... 
dblp:journals/eatcs/Natale18 fatcat:izzxjnsbz5eufg7hcnv3l7l3sm

Power of one qumode for quantum computation

Nana Liu, Jayne Thompson, Christian Weedbrook, Seth Lloyd, Vlatko Vedral, Mile Gu, Kavan Modi
2016 Physical Review A  
We introduce a new computational model based on a single squeezed state resource that can perform phase estimation, which we call the power of one qumode.  ...  Using the power of one qumode, we identify that the amount of squeezing is sufficient to quantify the resource requirements of different computational problems based on phase estimation.  ...  computational power.  ... 
doi:10.1103/physreva.93.052304 fatcat:6yfsag36e5f2hde2q5mttn5iju
« Previous Showing results 1 — 15 out of 4,418,698 results