16404 search results - page 143 / 3281 » A set coverage problem |
180
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
118
Voted
ORL
1998
15 years 3 months ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
146
Voted
CHI
2007
ACM
16 years 3 months ago
2007
ACM
Current web image search engines still rely on user typing textual description: query word(s) for visual targets. As the queries are often short, general or even ambiguous, the im...
122
click to vote
IFIP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
120
Voted
OOPSLA
1999
Springer
15 years 7 months ago
1999
Springer
Inspections can be used to identify defects in software artifacts. In this way, inspection methods help to improve software quality, especially when used early in software develop...