3356 search results - page 115 / 672 » Determining Consensus Numbers |
108
Voted
EOR
2006
15 years 2 months ago
2006
In this paper, a multi-period assignment problem is studied that arises as part of a weekly planning problem at mail processing and distribution centers. These facilities contain ...
156
Voted
JMLR
2008
15 years 2 months ago
2008
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
154
Voted
ALGORITHMICA
2002
15 years 2 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
133
Voted
JCO
2010
15 years 1 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
115
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— A cellular distributed antenna system with randomly located distributed antenna elements (AEs) and mobile users is considered. The AEs are connected to the base station...