4066 search results - page 434 / 814 » Almost Complete Sets |
148
click to vote
WAOA
2004
Springer
16 years 6 days 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...
160
click to vote
EDOC
2003
IEEE
16 years 5 days 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...
162
click to vote
FCCM
2003
IEEE
16 years 5 days 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...
185
click to vote
HICSS
2003
IEEE
16 years 5 days 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...
164
click to vote
HOTOS
2003
IEEE
16 years 5 days ago
2003
IEEE
Abstract—A Federated Array of Bricks (FAB) is a logical disk system that provides the reliability and performance of enterprise-class disk arrays, at a fraction of the cost and w...