Sciweavers

37 search results - page 2 / 8
» Nonnegative integral subset representations of integer sets
Sort
View
TCS
2010
13 years 3 months ago
Class constrained bin packing revisited
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
COMBINATORICS
2000
72views more  COMBINATORICS 2000»
13 years 4 months ago
Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Matthew Cook, Michael Kleber
DEXA
2005
Springer
110views Database» more  DEXA 2005»
13 years 10 months ago
Intensional Encapsulations of Database Subsets via Genetic Programming
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...
Aybar C. Acar, Amihai Motro
RSA
2010
104views more  RSA 2010»
13 years 3 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson
EJC
2007
13 years 5 months ago
An integrality theorem of root systems
Let Φ be an irreducible root system and ∆ be a base for Φ; it is well known that any root in Φ is an integral combination of the roots in ∆. In comparison to this fact, we ...
A. Bhattacharya, G. R. Vijayakumar