2137 search results - page 205 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
156
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
147
Voted
FOCS
2005
IEEE
16 years 2 days ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
185
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
167
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
179
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...