Sciweavers

314 search results - page 34 / 63
» Optimizing efficiency of perturbative Monte Carlo method
Sort
View
ANOR
2005
120views more  ANOR 2005»
14 years 9 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
ICMCS
2009
IEEE
219views Multimedia» more  ICMCS 2009»
14 years 7 months ago
Moving targets labeling and correspondence over multi-camera surveillance system based on Markov network
In this paper, we propose an efficient way to simultaneously label and map targets over a multi-camera surveillance system. In the system, we first fuse the detection results from...
Chingchun Huang, Sheng-Jyh Wang
SAC
2008
ACM
14 years 9 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
ISI
2008
Springer
14 years 9 months ago
Probabilistic frameworks for privacy-aware data mining
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...
Joydeep Ghosh
ICANNGA
2009
Springer
163views Algorithms» more  ICANNGA 2009»
15 years 1 months ago
Elitistic Evolution: An Efficient Heuristic for Global Optimization
A new evolutionary algorithm, Elitistic Evolution (termed EEv), is proposed in this paper. EEv is an evolutionary method for numerical optimization with adaptive behavior. EEv uses...
Francisco Viveros Jiménez, Efrén Mez...