Sciweavers

8647 search results - page 486 / 1730
» The Container Selection Problem
Sort
View
JAL
2002
99views more  JAL 2002»
15 years 5 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch
CCE
2010
15 years 3 months ago
A simple heuristic for reducing the number of scenarios in two-stage stochastic programming
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
Ramkumar Karuppiah, Mariano Martín, Ignacio...
IOR
2011
107views more  IOR 2011»
15 years 1 months ago
Information Collection on a Graph
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
Ilya O. Ryzhov, Warren B. Powell
CVPR
2005
IEEE
16 years 8 months ago
Fisher+Kernel Criterion for Discriminant Analysis
We simultaneously approach two tasks of nonlinear discriminant analysis and kernel selection problem by proposing a unified criterion, Fisher+Kernel Criterion. In addition, an eff...
Shu Yang, Shuicheng Yan, Dong Xu, Xiaoou Tang, Cha...
ICASSP
2008
IEEE
16 years 20 days ago
Application of sparse signal recovery to pilot-assisted channel estimation
We examine the application of current research in sparse signal recovery to the problem of channel estimation. Specifically, using an Orthogonal Frequency Division Multiplexed (O...
Matthew Sharp, Anna Scaglione