Sciweavers

8647 search results - page 1628 / 1730
» The Container Selection Problem
Sort
View
ASIACRYPT
2007
Springer
15 years 4 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
FPGA
2007
ACM
150views FPGA» more  FPGA 2007»
15 years 4 months ago
FPGA-friendly code compression for horizontal microcoded custom IPs
Shrinking time-to-market and high demand for productivity has driven traditional hardware designers to use design methodologies that start from high-level languages. However, meet...
Bita Gorjiara, Daniel Gajski
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
15 years 4 months ago
Genetic optimization for yacht design
This paper introduces a procedure for using genetic multiobjective optimization in yacht design. The problem described consists on the optimization of a bulb shape to improve the ...
Paolo Geremia, Mauro Poian, Silvia Poles
HIPEAC
2007
Springer
15 years 4 months ago
Performance/Energy Optimization of DSP Transforms on the XScale Processor
The XScale processor family provides user-controllable independent configuration of CPU, bus, and memory frequencies. This feature introduces another handle for the code optimizat...
Paolo D'Alberto, Markus Püschel, Franz Franch...
HIPEAC
2007
Springer
15 years 4 months ago
Branch History Matching: Branch Predictor Warmup for Sampled Simulation
Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on today...
Simon Kluyskens, Lieven Eeckhout
« Prev « First page 1628 / 1730 Last » Next »