13603 search results - page 273 / 2721 » On the Complexity of Computing Treelength |
141
click to vote
VLSID
2007
IEEE
16 years 6 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
157
click to vote
LICS
2009
IEEE
16 years 20 days ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
131
click to vote
GLOBECOM
2006
IEEE
16 years 2 days ago
2006
IEEE
— We investigate nonlinear precoding techniques for the downlink of multi-user systems from a transmitter equipped with multiple antennas to non-cooperative single antenna mobile...
137
click to vote
CONCUR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...
145
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...