B
Bennett L. Fox
Researcher at Université de Montréal
Publications - 32
Citations - 1349
Bennett L. Fox is an academic researcher from Université de Montréal. The author has contributed to research in topics: Markov chain & Simulated annealing. The author has an hindex of 17, co-authored 32 publications receiving 1299 citations. Previous affiliations of Bennett L. Fox include University of Colorado Denver.
Papers
More filters
Journal ArticleDOI
Computing Poisson probabilities
Bennett L. Fox,Peter W. Glynn +1 more
TL;DR: The proposed algorithm speeds generation of truncated Poisson variates and the computation of expected terminal reward in continuous-time, uniformizable Markov chains and can be used to evaluate formulas involving Poisson probabilities.
Journal ArticleDOI
Construction of Voronoi Polyhedra
TL;DR: In this article, the Voronoi diagram is constructed given a configuration of points, and a procedure for constructing the corresponding Voroni diagram is given, exact for molecules in the bulk polyhedra of surface molecules can be either eliminated or included using a periodic boundary condition.
Journal ArticleDOI
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
Eric V. Denardo,Bennett L. Fox +1 more
TL;DR: A new family of shortest-route methods are presented, which reduce an upper bound on running time, and make empirical comparisons for a certain class of networks, and allow for exploitation of structure by pruning arcs and/or nodes.
Journal ArticleDOI
Markov Renewal Programming by Linear Fractional Programming
TL;DR: In this article, the multichain case is handled by a decomposition approach, with particular attention given to the resolution of tied policies that minimize expected cost per unit time, and a linear fractional programming approach is used to solve the multi-chain case.
Journal ArticleDOI
Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
TL;DR: While simulating the original Markov chain with the original cooling schedule implicitly, this work speed up both stand-alone simulated annealing and the combination by a factor going to infinity as the number of transitions generated goes to infinity.