12519 search results - page 131 / 2504 » Approximation Problems Categories |
157
click to vote
AAAI
2004
15 years 7 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
139
click to vote
ESA
2009
Springer
16 years 28 days ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
158
click to vote
RECOMB
2003
Springer
16 years 6 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
163
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
166
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...