Sciweavers

4266 search results - page 131 / 854
» The container loading problem
Sort
View
194
Voted
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 5 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
139
Voted
CPAIOR
2008
Springer
15 years 4 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
173
Voted
CORR
2007
Springer
217views Education» more  CORR 2007»
15 years 2 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
145
Voted
FOCS
2009
IEEE
15 years 9 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
143
Voted
ICDT
2010
ACM
205views Database» more  ICDT 2010»
15 years 7 months ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu