Sciweavers

60 search results - page 1 / 12
» When lisp is faster than C
Sort
View
GECCO
2006
Springer
144views Optimization» more  GECCO 2006»
13 years 8 months ago
When lisp is faster than C
This paper compares the performance of the program evaluation phase of genetic programming using C and Common Lisp. A simple experiment is conducted, and the conclusion is that ge...
Børge Svingen
ASIACRYPT
2007
Springer
13 years 10 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é...
LISP
2007
74views more  LISP 2007»
13 years 4 months ago
Improving the lazy Krivine machine
Krivine presents the K machine, which produces weak head normal form results. Sestoft introduces several call-by-need variants of the K machine that implement result sharing via pu...
Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. S...
ASAP
2005
IEEE
121views Hardware» more  ASAP 2005»
13 years 10 months ago
Using TLM for Exploring Bus-based SoC Communication Architectures
As billion transistor System-on-chips (SoC) become commonplace and design complexity continues to increase, designers are faced with the daunting task of meeting escalating design...
Sudeep Pasricha, Mohamed Ben-Romdhane
DATE
2009
IEEE
140views Hardware» more  DATE 2009»
13 years 11 months ago
Lifetime reliability-aware task allocation and scheduling for MPSoC platforms
With the relentless scaling of semiconductor technology, the lifetime reliability of embedded multiprocessor platforms has become one of the major concerns for the industry. If th...
Lin Huang, Feng Yuan, Qiang Xu