Is there a standard recently-used algorithm based on time and usage count? Everyone is familiar with most recently used files lists in software and in OSs like Windows.

Some programs just sort by time. I've always been fairly annoyed at this. Others like Windows take usage count into consideration. Some move the item halfway to the top each time it is used, which seems to make sense.

Rather than me blindly guessing at what combination of calculations might be nicest for my end users, is there some well-known most helpful standard for end-user recently-used lists?

(My searches turn up information about MRU caching, but I can't tell how applicable any of that is; it's server efficiency facing vs user efficiency facing.)
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.