559 search results - page 49 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
ASPDAC
1999
ACM
13 years 12 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—In this contribution, we propose an original algorithm for self-localization in mobile ad-hoc networks. The proposed technique, based on interval analysis, is suited to ...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...