2976 search results - page 246 / 596 » On the bounded integer programming |
162
click to vote
DAM
2007
15 years 5 months ago
2007
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
152
click to vote
JACM
2007
15 years 5 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
150
click to vote
DAC
2007
ACM
16 years 6 months ago
2007
ACM
We discover significant value-dependent programming energy variations in multi-level cell (MLC) flash memories, and introduce an energy-aware data compression method that minimize...
259
click to vote
POPL
2007
ACM
16 years 5 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
155
click to vote
ISCA
2007
IEEE
15 years 11 months ago
2007
IEEE
The recently released SPEC CPU2006 benchmark suite is expected to be used by computer designers and computer architecture researchers for pre-silicon early design analysis. Partia...