1389 search results - page 207 / 278 » Improved Approximation Algorithms for Label Cover Problems |
138
Voted
ALGORITHMICA
2011
14 years 10 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
118
Voted
TCS
2010
14 years 9 months ago
2010
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...
123
click to vote
IPCO
2007
15 years 4 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
129
Voted
ICMLA
2008
15 years 4 months ago
2008
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
144
click to vote
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...