Sciweavers

229 search results - page 27 / 46
» Proving Bounds on Real-Valued Functions with Computations
Sort
View
FOCS
2010
IEEE
14 years 8 months ago
Black-Box Randomized Reductions in Algorithmic Mechanism Design
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
Shaddin Dughmi, Tim Roughgarden
CIE
2008
Springer
15 years 1 days ago
Many Facets of Complexity in Logic
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
Antonina Kolokolova
ISAAC
2005
Springer
110views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Minimum Entropy Coloring
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
TCS
2010
14 years 8 months ago
Runtime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
Dirk Sudholt, Carsten Witt
FOCS
2007
IEEE
15 years 4 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova