3791 search results - page 3 / 759 » Packing sets of patterns |
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
EOR
2007
13 years 5 months ago
2007
act 12 This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be 13 considered as a special case of bin packing. In the pr...
AMAI
2004
Springer
13 years 11 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
COMBINATORICS
2004
13 years 5 months ago
2004
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
COMBINATORICS
2002
13 years 5 months ago
2002