Sciweavers

1647 search results - page 158 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
15 years 10 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»
15 years 4 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
163
Voted
ICML
2004
IEEE
16 years 5 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
15 years 11 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
192
Voted
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 7 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang