Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,918
XLOOPS: Explicit Loop Specialization
"... Hardware specialization is becoming an increasingly com-mon technique to enable improved performance and effi-ciency in spite of the diminished benefits of technology scal-ing. Meanwhile, computer architects have long realized the importance of focusing on the key loops that often dominate applicati ..."
Abstract
- Add to MetaCart
programmable, yet still enable efficient exe-cution on both traditional and specialized microarchitec-tures. To address this challenge, this poster will present ongoing work on a new approach called explicit loop specialization
An analysis of explicit loops in genetic programming
- In Congress on Evolutionary Computation
, 2005
"... In this paper we analyse the reasons why evolving programs with a restricted form of loops is superior to evolving programs without loops for two problems which have underlying repetitive characteristics- a visitevery-square problem and a modified Santa Fe ant problem. We show that in the case of lo ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
In this paper we analyse the reasons why evolving programs with a restricted form of loops is superior to evolving programs without loops for two problems which have underlying repetitive characteristics- a visitevery-square problem and a modified Santa Fe ant problem. We show that in the case
An Explicit Loop Closing Technique for 6D SLAM
"... Abstract — Simultaneous Localization and Mapping (SLAM) is the problem of building a map of an unknown environment by a mobile robot while at the same time navigating the environment, using the unfinished map. For SLAM, two tasks have to be solved: First reliable feature extraction and data associat ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
that the map converges. This paper presents a novel approach for solving SLAM using 3D laser range scans. We aim at avoiding the iteration between the SLAM front- and backend and propose a novel explicit loop closing heuristic (ELCH). It dissociates the last scan of a sequence of acquired scans, reassociates
The program dependence graph and its use in optimization
- ACM Transactions on Programming Languages and Systems
, 1987
"... In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. ..."
Abstract
-
Cited by 996 (3 self)
- Add to MetaCart
In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program
Control-Flow Analysis of Higher-Order Languages
, 1991
"... representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: data-flow analysis, Scheme, LISP, ML, CPS, type recovery, higher-order functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful, ..."
Abstract
-
Cited by 365 (10 self)
- Add to MetaCart
optimisations that depend upon data-flow analysis: common-subexpression elimination, loop-invariant detection, induction-variable elimination, and many, many more. Compilers for higherorder languages do not provide these optimisations. Without them, Scheme, LISP and ML compilers are doomed to produce code
Bethe Ansatz for Quantum Strings
, 2004
"... We propose Bethe equations for the diagonalization of the Hamiltonian of quantum strings on AdS5×S 5 at large string tension and restricted to certain large charge states from a closed su(2) subsector. The ansatz differs from the recently proposed all-loop gauge theory asymptotic Bethe ansatz by add ..."
Abstract
-
Cited by 281 (16 self)
- Add to MetaCart
We propose Bethe equations for the diagonalization of the Hamiltonian of quantum strings on AdS5×S 5 at large string tension and restricted to certain large charge states from a closed su(2) subsector. The ansatz differs from the recently proposed all-loop gauge theory asymptotic Bethe ansatz
Discreteness of area and volume in quantum gravity
, 2008
"... We study the operator that corresponds to the measurement of volume, in non-perturbative quantum gravity, and we compute its spectrum. The operator is constructed in the loop representation, via a regularization procedure; it is finite, background independent, and diffeomorphism-invariant, and there ..."
Abstract
-
Cited by 242 (35 self)
- Add to MetaCart
We study the operator that corresponds to the measurement of volume, in non-perturbative quantum gravity, and we compute its spectrum. The operator is constructed in the loop representation, via a regularization procedure; it is finite, background independent, and diffeomorphism
Experiments with explicit for-loops in genetic programming
- in Evolutionary Computation, 2004. CEC2004. Congress on
, 2004
"... Abstract — Evolving programs with explicit loops presents ma-jor difficulties, primarily due to the massive increase in the size of the search space. Fitness evaluation becomes computationally expensive and a method for dealing with infinite loops must be implemented. We have investigated ways of de ..."
Abstract
-
Cited by 8 (4 self)
- Add to MetaCart
Abstract — Evolving programs with explicit loops presents ma-jor difficulties, primarily due to the massive increase in the size of the search space. Fitness evaluation becomes computationally expensive and a method for dealing with infinite loops must be implemented. We have investigated ways
Covariant operator formalism of gauge theories and quantum gravity,” World Sci. Lect. Notes Phys
, 1990
"... The new method proposed previously for solving the covariant operator formalism of quantum Einstein gravity is applied to quantum electrodynamics as an exercise of the application to quantum chromodynamics. The purposes of doing this are to establish the details of the method and to reconfirm the va ..."
Abstract
-
Cited by 214 (5 self)
- Add to MetaCart
the validity of the method. The Wightman functions are explicitly constructed, at tree and one-loop levels, so as to be consistent with four-dimensional multiple (anti)commutators and with the energy-positivity condition. Quantum chromodynamics is a non-abelian gauge theory, for which the covariant operator
Results 1 - 10
of
2,918
