127 search results - page 10 / 26 » Finding design qualities in a tangible programming space |
ISCAS
2006
IEEE
15 years 5 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
OSDI
1994
ACM
15 years 10 days ago
1994
ACM
This paper describes the design and evaluation of SAM, a shared object system for distributed memory machines. SAM is a portable run-time system that provides a global name space ...
96
Voted
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
217
click to vote
PLDI
2009
ACM
15 years 11 months ago
2009
ACM
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....
ISPASS
2005
IEEE
15 years 4 months ago
2005
IEEE
Performance evaluation using only a subset of programs from a benchmark suite is commonplace in computer architecture research. This is especially true during early design space e...