3862 search results - page 416 / 773 » Adaptive Noisy Optimization |
184
click to vote
IPPS
2006
IEEE
16 years 24 days ago
2006
IEEE
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
180
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
186
click to vote
SIAMCO
2002
15 years 6 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
178
click to vote
IOR
2010
15 years 4 months ago
2010
The paper considers a stylized model of a dynamic assortment optimization problem, where given a limited capacity constraint, we must decide the assortment of products to offer to...
196
click to vote
TOMCCAP
2011
15 years 1 months ago
2011
tion problem in two steps. First, we formulate an abstract optimization problem for video streaming in wireless networks in general. This formulation exposes the important interact...