1142 search results - page 15 / 229 » Approximability of Clausal Constraints |
IPL
2000
14 years 11 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
TIT
2011
14 years 6 months ago
2011
We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an activ...
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
110
click to vote
CSR
2009
Springer
15 years 23 days ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
CORR
2000
Springer
14 years 11 months ago
2000
Springer
Previous work (Frank and Satta, 1998; Karttunen, 1998) has shown that Optimality Theory with gradient constraints generally is not finite state. A new finite-state treatment of gr...