7129 search results - page 412 / 1426 » Approximation Algorithms for Treewidth |
126
click to vote
ICS
2010
Tsinghua U.
16 years 2 months ago
2010
Tsinghua U.
: We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. W...
168
click to vote
FOCS
2009
IEEE
15 years 12 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
134
click to vote
JAL
2002
15 years 4 months ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
131
click to vote
IJCAI
1989
15 years 6 months ago
1989
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
183
click to vote
SIGMOD
2004
ACM
16 years 5 months ago
2004
ACM
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...