Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
Abstract. Markov Random Fields (MRFs) 5] are a class of probabalistic models that have been applied for many years to the analysis of visual patterns or textures. In this paper, ou...
Deryck F. Brown, A. Beatriz Garmendia-Doval, John ...
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
We study the problem of multivariate integration on the unit cube for unbounded integrands. Our study is motivated by problems in statistics and mathematical finance, where unboun...
Benjamin J. Waterhouse, Frances Y. Kuo, Ian H. Slo...