518 search results - page 10 / 104 » Beating a Random Assignment |
106
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In this work we suggest a new model for generating random satisfiable k-CNF formulas. To generate such formulas
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
110
click to vote
GLOBECOM
2007
IEEE
14 years 12 months ago
2007
IEEE
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
MP
2007
14 years 11 months ago
2007
The Multidimensional Assignment Problem (MAP) is a higher-dimensional version of the Linear Assignment Problem that arises in the areas of data association, target tracking, resou...
118
click to vote
JGO
2011
14 years 2 months ago
2011
The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength...