Sciweavers

403 search results - page 47 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
TWC
2011
291views more  TWC 2011»
13 years 4 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
WSC
2008
14 years 6 days ago
Simulation based optimization of multi-location transshipment problem with capacitated transportation
In this study, a single-item two-echelon inventory system where the items can be stored in each of N stocking locations is optimized using simulation. The aim of this study is to ...
Banu Yetkin Ekren, Sunderesh S. Heragu
ICML
1998
IEEE
14 years 10 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
IPPS
1997
IEEE
14 years 2 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
WSC
2007
14 years 6 days ago
New greedy myopic and existing asymptotic sequential selection procedures: preliminary empirical results
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
Stephen E. Chick, Jürgen Branke, Christian Sc...