1933 search results - page 186 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
141
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
146
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
133
click to vote
CINQ
2004
Springer
15 years 8 months ago
2004
Springer
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
146
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
151
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
—We present an optimal methodology for dynamic voltage scheduling problem in the presence of realistic assumption such as leakage-power and intra-task overheads. Our contribution...