681 search results - page 112 / 137 » General Polynomial Time Decomposition Algorithms |
112
click to vote
PODS
2007
ACM
16 years 17 days ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
DAC
2003
ACM
16 years 1 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
201
Voted
POPL
2005
ACM
16 years 22 days ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
98
Voted
STOC
2009
ACM
16 years 1 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...
157
Voted
STOC
2007
ACM
16 years 22 days ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...