16404 search results - page 546 / 3281 » A set coverage problem |
162
click to vote
SOFSEM
2004
Springer
16 years 8 days ago
2004
Springer
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
155
click to vote
GECCO
2003
Springer
16 years 4 days ago
2003
Springer
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
169
click to vote
EDBTW
2010
Springer
16 years 1 days ago
2010
Springer
We study the problem of update propagation across views in the setting where both the view and the source database are XML documents. We consider a simple class of XML views that ...
168
click to vote
CPM
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
178
click to vote
HM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...