Sciweavers

14649 search results - page 439 / 2930
» Principles of problem solving
Sort
View
EOR
2006
130views more  EOR 2006»
15 years 6 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
JMLR
2008
137views more  JMLR 2008»
15 years 6 months ago
Online Learning of Complex Prediction Problems Using Simultaneous Projections
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
Yonatan Amit, Shai Shalev-Shwartz, Yoram Singer
SCL
2008
56views more  SCL 2008»
15 years 6 months ago
A new vertex result for robustness problems with interval matrix uncertainty
This paper1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a n...
Teodoro Alamo, Roberto Tempo, Daniel R. Ramí...
APIN
2005
92views more  APIN 2005»
15 years 6 months ago
A Hybrid Neural-Genetic Algorithm for the Frequency Assignment Problem in Satellite Communications
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...
Sancho Salcedo-Sanz, Carlos Bousoño-Calz&oa...
JAL
2002
71views more  JAL 2002»
15 years 6 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...