152 search results - page 23 / 31 » Tetris is Hard, Even to Approximate |
101
click to vote
STOC
2009
ACM
16 years 9 days ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
124
click to vote
WADS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
RECOMB
2007
Springer
16 years 6 hour ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...