882 search results - page 60 / 177 » Local Search for Very Large SAT Problems |
172
click to vote
SLS
2009
Springer
15 years 4 months ago
2009
Springer
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
RTSS
1999
IEEE
15 years 4 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
KDD
2001
ACM
16 years 7 days ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
AAAI
1996
15 years 1 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
CIDR
2007
15 years 1 months ago
2007
Searching the Web has become a commodity. However, extending applications with search capabilities is still an open research topic [2]. Large enterprise applications such as SAP a...