Sciweavers

1248 search results - page 122 / 250
» On the Number of Birch Partitions
Sort
View
SIAMJO
2008
175views more  SIAMJO 2008»
13 years 10 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
MCS
2007
Springer
13 years 10 months ago
Parallel unstructured mesh generation by an advancing front method
Mesh generation is a critical step in high fidelity computational simulations. High-quality and high-density meshes are required to accurately capture the complex physical phenome...
Yasushi Ito, Alan M. Shih, Anil K. Erukala, Bharat...
DCG
2002
71views more  DCG 2002»
13 years 9 months ago
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
The volume of the n-dimensional polytope nx := fy 2 Rn : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := x1; : : : ; xn with xi 0 for all i de nes a polyn...
Richard P. Stanley, Jim Pitman
NETWORKS
2007
13 years 9 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
JCT
2010
82views more  JCT 2010»
13 years 8 months ago
Major index for 01-fillings of moon polyominoes
We propose a major index statistic on 01-fillings of moon polyominoes which, when specialized to certain shapes, reduces to the major index for permutations and set partitions. W...
William Y. C. Chen, Svetlana Poznanovic, Catherine...