Sciweavers

9260 search results - page 1647 / 1852
» Posterior distributions are computable from predictive distr...
Sort
View
COR
2008
111views more  COR 2008»
15 years 6 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
AUTOMATICA
2006
140views more  AUTOMATICA 2006»
15 years 6 months ago
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...
ICGA
2008
208views Optimization» more  ICGA 2008»
15 years 6 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
CN
2006
66views more  CN 2006»
15 years 6 months ago
Secure acknowledgment aggregation and multisignatures with limited robustness
In certain reliable group-oriented and multicast applications, a source needs to securely verify whether all (and if not all, which) intended receivers have received a message. How...
Claude Castelluccia, Stanislaw Jarecki, Jihye Kim,...
COR
2006
140views more  COR 2006»
15 years 6 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
« Prev « First page 1647 / 1852 Last » Next »