559 search results - page 90 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
CP
2007
Springer
14 years 2 months ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
FLAIRS
2004
13 years 10 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
IAJIT
2008
13 years 8 months ago
2008
: The recent explosion in digital video storage and delivery has presented strong motivation for high performance video compression solutions. An efficient video compression techni...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
CIC
2004
13 years 10 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...