APPLICATION OF MARKOV DECISION PROCESSES TO THE FREQUENCY ASSIGNMENT PROBLEM
暂无分享,去创建一个
[1] Ronald A. Howard,et al. Dynamic Programming and Markov Processes , 1960 .
[2] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[3] Leslie Pack Kaelbling,et al. Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] S. U. Thiel,et al. FASoft: A system for discrete channel frequency assignment , 1997 .
[6] René Schott,et al. New hybrid genetic algorithms for the frequency assignment problem , 2002, IEEE Trans. Broadcast..
[7] F. Comellas,et al. An Ant Algorithm for the Graph Colouring Problem , 1998 .
[8] Charles Fleurent,et al. Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..
[9] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[10] Fred W. Glover,et al. A user's guide to tabu search , 1993, Ann. Oper. Res..
[11] A. Lumsdaine,et al. A Sparse Matrix Library in C + + for High PerformanceArchitectures , 1994 .
[12] Robert Givan,et al. Bounded-parameter Markov decision processes , 2000, Artif. Intell..
[13] Marco Dorigo,et al. The ant colony optimization meta-heuristic , 1999 .
[14] Sean R Eddy,et al. What is dynamic programming? , 2004, Nature Biotechnology.