3736 search results - page 470 / 748 » Generative Programming |
174
click to vote
MP
2010
15 years 4 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
182
click to vote
IWMM
2007
Springer
16 years 15 days ago
2007
Springer
In this work, we present accordion arrays, a straightforward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs...
183
click to vote
ISSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Datapath width optimization is very effective for reducing the area of a custom-made embedded system. The trivial way of optimization is to iteratively customize, evaluate, and r...
156
click to vote
ICFP
2000
ACM
15 years 10 months ago
2000
ACM
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
174
click to vote
WSC
1997
15 years 7 months ago
1997
We present an extension to an existing SPARC V8 instruction set simulator, SimICS, to support accurate profiling of branches and instruction cache misses. SimICS had previously su...