3172 search results - page 188 / 635 » On the Random-Self-Reducibility of Complete Sets |
151
click to vote
PARA
2004
Springer
15 years 12 months ago
2004
Springer
There is an immediate need to develop Grid interfaces for a large set of numerical software libraries, in order to make popular software of today available in the computing infrast...
141
click to vote
WAOA
2004
Springer
15 years 12 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
154
click to vote
EDOC
2003
IEEE
15 years 11 months ago
2003
IEEE
The expression of contracts in computer readable form, and the development of automated tests for completeness and well-formedness of contracts, has opened the door to significant...
155
click to vote
FCCM
2003
IEEE
15 years 11 months ago
2003
IEEE
A module has been implemented in Field Programmable Gate Array (FPGA) hardware that scans the content of Internet packets at Gigabit/second rates. All of the packet processing ope...
177
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
Inductive representation of conditional knowledge means to complete knowledge appropriately and can be looked upon as an instance of quite a general representation problem. The cr...