Sciweavers

783 search results - page 57 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
STACS
2007
Springer
14 years 2 months ago
On Completing Latin Squares
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
Iman Hajirasouliha, Hossein Jowhari, Ravi Kumar, R...
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
14 years 2 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
EOR
2007
364views more  EOR 2007»
13 years 8 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
ICML
2004
IEEE
14 years 9 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
IJCNN
2006
IEEE
14 years 2 months ago
Cellular SRN Trained by Extended Kalman Filter Shows Promise for ADP
— Cellular simultaneous recurrent neural network has been suggested to be a function approximator more powerful than the MLP’s, in particular for solving approximate dynamic pr...
Roman Ilin, Robert Kozma, Paul J. Werbos