Sciweavers

5331 search results - page 237 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
201
Voted
SIAMJO
2002
92views more  SIAMJO 2002»
15 years 6 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
ICPP
2007
IEEE
16 years 1 months ago
Efficient Parallel Algorithm for Optimal Three-Sequences Alignment
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
Chun-Yuan Lin, Chen Tai Huang, Yeh-Ching Chung, Ch...
174
Voted
JSAC
2007
109views more  JSAC 2007»
15 years 7 months ago
Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...
Yiming Zhang, Oliver W. W. Yang, Jing Wu, Michel S...
221
Voted
WIOPT
2010
IEEE
15 years 5 months ago
Optimal slotted random access in coded wireless packet networks
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
Maximilian Riemensberger, Michael Heindlmaier, And...
169
Voted
WEA
2004
Springer
120views Algorithms» more  WEA 2004»
16 years 11 days ago
An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
Vinhthuy T. Phan, Steven Skiena