152 search results - page 25 / 31 » Tetris is Hard, Even to Approximate |
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
OOPSLA
2005
Springer
14 years 1 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
WADS
1997
Springer
14 years 17 days ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
GECCO
2010
Springer
13 years 12 months ago
2010
Springer
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...