Sciweavers

144 search results - page 9 / 29
» Automatic generation of polynomial loop
Sort
View
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile
DAC
2008
ACM
14 years 8 months ago
DVFS in loop accelerators using BLADES
Hardware accelerators are common in embedded systems that have high performance requirements but must still operate within stringent energy constraints. To facilitate short time-t...
Ganesh S. Dasika, Shidhartha Das, Kevin Fan, Scott...
ICPP
2000
IEEE
13 years 12 months ago
Partitioning Loops with Variable Dependence Distances
A new technique to parallelize loops with variable distance vectors is presented. The method extends previous methods in two ways. First, the present method makes it possible for ...
Yijun Yu, Erik H. D'Hollander
DM
2007
98views more  DM 2007»
13 years 7 months ago
p-adic valuations and k-regular sequences
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
Jason P. Bell
ENTCS
2010
208views more  ENTCS 2010»
13 years 4 months ago
Accelerated Invariant Generation for C Programs with Aspic and C2fsm
In this paper, we present Aspic, an automatic polyhedral invariant generation tool for flowcharts programs. Aspic implements an improved Linear Relation Analysis on numeric counte...
Paul Feautrier, Laure Gonnord