16844 search results - page 3112 / 3369 » How to Design Programs |
191
click to vote
MST
2010
15 years 5 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
195
click to vote
PE
2010
Springer
15 years 5 months ago
2010
Springer
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
213
click to vote
PVLDB
2010
15 years 5 months ago
2010
Analysts have marked Event Processing as the most growing segment in enterprise computing during years 2008 and 2009, furthermore, this trend is expected to continue. Many of the ...
167
click to vote
WCRE
2010
IEEE
15 years 5 months ago
2010
IEEE
—Automatic and advanced merging algorithms help programmers to merge their modifications in main development repositories. However, there is little support to help release maste...
223
click to vote
FPL
2010
Springer
15 years 4 months ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...