Assume you have a vector A and you going to sort it according to a function f(x). If you sort it naively, whenever you are going to compare two items, you call the function. Because the best sorting algorithm we know nowadays is \(O(n \log n)\), you call such function...
[more]
Michael Dritschel (2008) Stochastic Calculus in Mathematical Finance
It has a very nice summary of modern probability theory at the beginning.
[more]
Oh and Ahn (1999) Dynamic Calendar Queue (Sim Symp)
PDF
[more]
Brown (1988) Calendar Queues: A Fast O(1) Priority Queue Implementation for the Simulation Event Set Problem
This is the seminal paper that proposes the calendar queues which can be used for DES. Events are classified into “days” and different “days” are put into an array as a “year”. When we insert, put the event into an appropriate day according to the event’s deadline. When we dequeue...
[more]
年糕
材料:
[more]
