2976 search results - page 120 / 596 » On the bounded integer programming |
ARSCOM
2008
15 years 22 days ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
92
Voted
FOCS
1993
IEEE
15 years 4 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
134
Voted
CSL
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
PPDP
2001
Springer
15 years 5 months ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
106
Voted
TIT
2002
15 years 7 days ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...