Sciweavers

10407 search results - page 347 / 2082
» Market-Based Approaches to Optimization
Sort
View
IPCO
2007
108views Optimization» more  IPCO 2007»
15 years 8 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
CCE
2006
15 years 6 months ago
State-of-the-art review of optimization methods for short-term scheduling of batch processes
There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. The main go...
Carlos A. Méndez, Jaime Cerdá, Ignac...
TON
2002
75views more  TON 2002»
15 years 6 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
CP
2007
Springer
16 years 1 months ago
An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search
Abstract. Stochastic Local Search (SLS) is a simple and effective paradigm for attacking a variety of Combinatorial (Optimization) Problems (COP). However, it is often non-trivial...
Steven Halim, Roland H. C. Yap, Hoong Chuin Lau
IVC
2007
114views more  IVC 2007»
15 years 6 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...