Sciweavers

4526 search results - page 129 / 906
» Algorithmic problems related to the Internet
Sort
View
FOCS
2009
IEEE
15 years 11 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
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 9 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
141
Voted
TALG
2010
101views more  TALG 2010»
15 years 2 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert
FOSSACS
2009
Springer
15 years 11 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
140
Voted
EMO
2003
Springer
86views Optimization» more  EMO 2003»
15 years 9 months ago
No Free Lunch and Free Leftovers Theorems for Multiobjective Optimisation Problems
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
David Corne, Joshua D. Knowles