2899 search results - page 364 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
157
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
209
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
188
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
173
click to vote
JAIR
2006
15 years 6 months ago
2006
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
223
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...