Abstract
Ada Gem #5 --- Sets are containers of elements. Like all containers, they are searchable, and given an element value you can find the element in the set equivalent to that value. For some applications, element equivalence is determined by just a part of the element (its "key" part), and it is often necessary to find an element given only a key value. A technique is presented here for key-based searching of elements in set containers.
Index Terms
Gem #5: Key-based searching in set containers
Recommendations
A comparison of layouts of reefer containers in automated container terminal
SMO'06: Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and OptimizationFor managing reefer containers more efficiently, it is important to optimally determine the block size and the layout of reefer containers in the early design phase. Work balances among blocks of a yard have a significant effect on the productivity of ...
Monte Carlo Tree Search algorithm for the receiving containers intelligently problem among container shipping terminals
With the development of economic globalization, shipping exchanges between countries are rapidly increasing and the container throughput of shipping ports has increased quickly, and the operation of most seaport terminals in China has reached a ...
A covering-based pessimistic multigranulation rough set
ICIC'11: Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applicationsIn view of granular computing, the classical optimistic and pessimistic multigranulation rough set models are both primarily based on simple granules among multiple granular structures, namely multiple partitions of the universe in MGRS. This ...






Comments