976 search results - page 39 / 196 » The Complexity of Timetable Construction Problems |
ESOP
2001
Springer
13 years 12 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
ACMICEC
2003
ACM
14 years 20 days ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But COD...