380 search results - page 60 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
102
Voted
IJCAI
2007
14 years 11 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
AIPS
2008
14 years 12 months ago
2008
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
99
Voted
ACAL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model that helps to produce a visualization of microarray data, based on the r...
103
Voted
HT
1991
ACM
15 years 1 months ago
1991
ACM
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
120
Voted
PAMI
2012
12 years 12 months ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...