840 search results - page 82 / 168 » Inapproximability of Combinatorial Optimization Problems |
ECML
2007
Springer
15 years 6 months ago
2007
Springer
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but in...
120
click to vote
STOC
1995
ACM
15 years 4 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
109
Voted
EAAI
2007
15 years 12 days ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de�...
127
Voted
JMLR
2008
15 years 13 days ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
114
Voted
GECCO
2009
Springer
14 years 10 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...