3836 search results - page 107 / 768 » Optimizing the Use of High Performance Software Libraries |
119
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Implementing a multi-tone (MT) architecture for high-speed backplane electrical links is difficult given the tight power and complexity constraints in this application. This pa...
193
click to vote
PEPM
2011
ACM
14 years 6 months ago
2011
ACM
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...
153
Voted
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Comp...
159
Voted
EDBT
2000
ACM
15 years 7 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
140
click to vote
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...