14518 search results - page 295 / 2904 » Two Problems for Sophistication |
188
click to vote
EJC
2008
15 years 6 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
170
click to vote
EOR
2008
15 years 6 months ago
2008
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
162
click to vote
COR
2006
15 years 6 months ago
2006
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
194
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the sample size), a...
161
Voted
ECCC
2006
15 years 6 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...