Is there a standard recently-used algorithm based on time and usage count?
This concept is indeed known in data structures as self-adjusting/-organizing lists. Possible strategies include


move the accessed element to the front,
maintain a sorted list by (potentially degrading) counts, and
move the accessed element one step towards the front.


Many more strategies are possible; which is most suitable depends a lot on the specific situation.