1. An electronic device comprising:
storage media for storing data in the electronic device;
a wireless communication interface; and
a processor which monitors contents of the storage media, wherein upon the storage media reaching a preset capacity the processor automatically initiates a connection from the wireless communication interface to transfer the contents from the storage media.
2. The electronic device of claim 1, wherein the wireless communication interface connects with a remote storage device.
3. The electronic device of claim 2, wherein the contents of the storage media is transferred to the remote storage device.
4. The electronic device of claim 1, wherein the wireless communication interface is a cellular interface.
5. The electronic device of claim 1, wherein the wireless communication interface is a Bluetooth interface.
6. The electronic device of claim 1, wherein the wireless communication interface is a wireless LAN interface.
7. The electronic device of claim 1, wherein the storage media is a flash memory card.
8. The electronic device of claim 1, wherein the electronic device is selected from a group consisting of: a digital camera, a camcorder, a personal digital assistant, a portable game system, a portable music player and a portable movie player.
9. A method of managing memory in an electronic device comprising:
determining contents of the memory have exceeded a predetermined level;
automatically establishing a wireless connection between the electronic device and a remote storage device; and
transferring at least a portion of the contents of the memory to the remote storage device.
10. The method of claim 9, further comprising deleting the contents of the memory that is transferred to the remote storage device.
11. The method of claim 9, further comprising informing a user the transfer is complete.
12. The method of claim 9, further comprising waiting a predetermined time period if establishing the wireless connection is unsuccessful.
13. The method of claim 12, further comprising reattempting to establish the wireless connection.
14. The method of claim 9, wherein the wireless connection is a cellular connection.
15. The method of claim 9, wherein the wireless connection is a Bluetooth connection.
16. The method of claim 9, wherein the wireless connection is a wireless LAN connection.
17. The method of claim 9, wherein the memory is a flash memory card.
18. The method of claim 9, wherein the electronic device is selected from a group consisting of: a digital camera, a camcorder, a personal digital assistant, a portable game system, a portable music player and a portable movie player.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A selection process designed to select optimized results from a plurality of possible results represented in a search tree, the process comprising:
employing a tree-search, wherein bounds are used to prune at least one node or branch of the search tree;
invoking a non-overlapping support constraint in conjunction with the tree search to further prune the search tree, wherein the non-overlapping support constraint which requires that any one node or branch must support at most one other accepted node or branch which has been selected by the tree search process is relaxed to permit support of more than one other accepted node or branch;
storing an optimized search tree into memory, following the invoking of the non-overlapping support constraint; and
employing the optimized search tree in additional processing operations.
2. The process according to claim 1, wherein the tree search is a depth-first tree search.
3. The process according to claim 1, wherein the tree search is a best-first tree search.
4. The process according to claim 1, wherein the non-overlapping support constraint includes dynamically vetoing nodes or branches of the search tree based on decisions made higher in the search tree by the tree search process.
5. The process according to claim 4, further including non-vetoing previously vetoed nodes or branches of the search tree.
6. The process according to claim 1, wherein the non-overlapping constraint includes searching a binary tree where one branch corresponds to assigning true values and the other branch corresponds to assigning false values.
7. In a computer controlled system, provided is a method designed to select optimized results from a plurality of possible results represented in a search tree, the method comprising:
employing a tree-search, wherein bounds are used to prune at least one node or branch of the search tree;
invoking a non-overlapping support constraint in conjunction with the tree search to further prune the search tree, wherein the non-overlapping support constraint includes dynamically vetoing nodes or branches of the search tree based on decisions made higher in the search tree by the tree search process;
storing an optimized search tree into a memory of the computer controlled system, following the invoking of the non-overlapping support constraint; and
employing the optimized search tree in additional computer controlled processing operations.
8. The method according to claim 7, wherein the tree search is a depth-first tree search.
9. The method according to claim 7, wherein the tree search is a best-first tree search.
10. The method according to claim 7, wherein the non-overlapping support constraint requires that anyone node or branch must support at most one other accepted node or branch of the search tree which has been selected by the tree search process.
11. The method of claim 10, wherein the non-overlapping support constraint which requires that anyone branch must support at most one other accepted node or branch which has been selected by the tree search process, is relaxed to permit support of more than one other accepted node or branch.
12. The method according to claim 7, further including non-vetoing previously vetoed nodes or branches of the search tree.
13. The method according to claim 7, wherein the non-overlapping constraint includes searching a binary tree where one branch corresponds to assigning true values and the other branch corresponds to assigning false values.
14. In a computer controlled system, provided is a method designed to select optimized results from a plurality of possible results represented in a search tree, the method comprising:
employing a tree-search, wherein bounds are used to prune at least one node or branch of the search tree;
invoking a non-overlapping support constraint in conjunction with the tree search to further prune the search tree, wherein the non-overlapping support constraint which requires that any one node or branch must support at most one other accepted node or branch which has been selected by the tree search process is relaxed to permit support of more than one other accepted node or branch;
storing an optimized search tree into memory, following the invoking of the non-overlapping support constraint; and
employing the optimized search tree in additional processing operations.
15. The method according to claim 14, wherein the non-overlapping support constraint includes dynamically vetoing nodes or branches of the search tree based on decisions made higher in the search tree by the tree search process.
16. The method according to claim 15, further including non-vetoing previously vetoed nodes or branches of the search tree.