Sciweavers

3367 search results - page 268 / 674
» Incremental assignment problem
Sort
View
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
15 years 2 months ago
How to Play Unique Games on Expanders
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
Konstantin Makarychev, Yury Makarychev
CORR
2011
Springer
180views Education» more  CORR 2011»
14 years 8 months ago
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
Lisa Fleischer, Zhenghui Wang
ICPR
2004
IEEE
16 years 5 months ago
Relaxation Labeling Processes for Protein Secondary Structure Prediction
The prediction of protein secondary structure is a classical problem in bioinformatics, and in the past few years several machine learning techniques have been proposed to t. From...
Giacomo Colle, Marcello Pelillo
RECOMB
2005
Springer
16 years 4 months ago
Reversals of Fortune
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
David Sankoff, Chunfang Zheng, Aleksander Lenert
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
15 years 8 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman