The El Farol Bar Problem for next generation systems

More documents

Recommendations

Info

$Modelling Network Traffic Via a Multifractal Wavelet Model ...$

54 APPENDIX A. C CODE FOR THE EL FAROL BAR PROBLEM /* Uncomment for up/down shuffle */ // if (p_agent[i*M+k]>up) {p_agent[i*M+k]=down;} // if (p_agent[i*M+k]up) {p_agent[i*M+k]=(1.0/d)*p_agent[i*M+k];} if (p_agent[i*M+k]
} /* This bit calculates the attendances. If the new god element is not 99 then the attendance is as usual calculated by the probability. If it is to 99, it is so because it is after a sequence of attendances and this and the following w-1 must be set to 0 */ for(k=0; kgsl_ran_flat(r,0,1)) {a_agent[k]=1;god[i*M+k]=1;} else {a_agent[k]=0;god[i*M+k]=0;} } else if(god[i*M+k]==99) {god[i*M+k]=0; a_agent[k]=0;} } a_total[i]=sumar(M,a_agent); for(k=0; k
Page 1:
The El Farol Bar Problem for next g
Page 4 and 5:
List of Figures 1.1. Bar attendance
Page 6 and 7:
Acknowledgements I would like to de
Page 8 and 9:
2 CHAPTER 1. CHAOS, COMPLEXITY AND
Page 10 and 11: 4 CHAPTER 1. CHAOS, COMPLEXITY AND
Page 16 and 17: 10 CHAPTER 2. PREVIOUS APPROACHES T
Page 30 and 31: 24 CHAPTER 3. ANALYSIS AND EXTENSIO
Page 44 and 45: 38 CHAPTER 4. CASE STUDY: MULTIPLE
Page 50 and 51: 44 CHAPTER 5. CONCLUSIONS Another n
Page 52 and 53: 46 CHAPTER 5. CONCLUSIONS
Page 54 and 55: 48 APPENDIX A. C CODE FOR THE EL FA
Page 66: 60 BIBLIOGRAPHY [14] Challet D. and
show all

The El Farol Bar Problem for next generation systems

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?