10493 search results - page 202 / 2099 » Dynamic Word Problems |
ICALP
2001
Springer
14 years 22 days ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
SEBD
2008
13 years 9 months ago
2008
Abstract. Model management is a metadata-based approach to database problems aimed at supporting the productivity of developers by providing schema manipulation operators. Here we ...
4OR
2008
13 years 8 months ago
2008
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
COR
2010
13 years 8 months ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
ECCC
2006
13 years 8 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...