A parallel workflow for online correlation and clique-finding : with applications to finance
作者： Camilo Rostoker
DOI: 10.14288/1.0051985
关键词:
摘要:
sci-hub.st 参考文章(103)
Satu Elisa Schaeffer, Stochastic Local Clustering for Massive Graphs Advances in Knowledge Discovery and Data Mining. pp. 354- 360 ,(2005) , 10.1007/11430919_42
James Vaigl, Greg Burns, Raja Daoud, LAM: An Open Cluster Environment for MPI ,(2002)
Joseph C. Culberson, Mark Brockington, Camouflaging independent sets in quasi-random graphs. Cliques, Coloring, and Satisfiability. pp. 75- 88 ,(1993)
P. Pardalos, J. Abello, M. G. C. Resende, On maximum clique problems in very large graphs External memory algorithms. pp. 119- 130 ,(1999)
Holger H. Hoos, Kevin O''Neill, Stochastic Local Search Methods for Dynamic SAT- an Initial Investigation University of British Columbia. ,(2000)
Bahram Alidaee, César Rego, Metaheuristic optimization via memory and evolution : tabu search and scatter search Kluwer Academic. ,(2005)
Ganapathy Vidyamurthy, Pairs Trading: Quantitative Methods and Analysis ,(2004)
Celso C. Ribeiro, Pierre Hansen, Essays and Surveys in Metaheuristics Kluwer Academic Publishers. ,(2002) , 10.1007/978-1-4615-1507-4
Holger H. Hoos, Thomas Stützle, T. Walsh, I. Gent, H. Van Maaren, SATLIB: An Online Resource for Research on SAT theory and applications of satisfiability testing. pp. 283- 292 ,(2000)
Russell Bent, Pascal Van Hentenryck, Online stochastic and robust optimization Lecture Notes in Computer Science. pp. 286- 300 ,(2004) , 10.1007/978-3-540-30502-6_21