1070 search results - page 132 / 214 » Benchmarking Adaptive Indexing |
105
click to vote
CRYPTO
2012
Springer
13 years 11 days ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
EUROPAR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Prefetching transfers a data item in advance from its storage location to its usage location so that communication is hidden and does not delay computation. We present a ...
PLDI
2000
ACM
15 years 2 months ago
2000
ACM
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
104
click to vote
FPGA
1995
ACM
15 years 1 months ago
1995
ACM
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...