152 search results - page 5 / 31 » Tetris is Hard, Even to Approximate |
SODA
2010
ACM
14 years 10 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
100
Voted
PATMOS
2007
Springer
15 years 5 months ago
2007
Springer
This work deals with the problem to optimise the energy consumption of an embedded system. On system level, tasks are assumed to have a certain CPU-usage they need for completion. ...
122
click to vote
DLOG
2009
14 years 9 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
86
Voted
SIGECOM
2005
ACM
15 years 5 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
ECCC
2006
14 years 11 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...