Sciweavers

1576 search results - page 268 / 316
» Properties of Synthetic Optimization Problems
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 10 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
COR
2007
81views more  COR 2007»
13 years 10 months ago
Job scheduling methods for reducing waiting time variance
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of thei...
Nong Ye, Xueping Li, Toni Farley, Xiaoyun Xu
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
14 years 1 months ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
14 years 4 months ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...
BMCBI
2008
170views more  BMCBI 2008»
13 years 10 months ago
A genetic approach for building different alphabets for peptide and protein classification
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...
Loris Nanni, Alessandra Lumini