Sciweavers

3356 search results - page 115 / 672
» Determining Consensus Numbers
Sort
View
EOR
2006
70views more  EOR 2006»
13 years 9 months ago
A multi-period machine assignment problem
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 ...
Xinhui Zhang, Jonathan F. Bard
JMLR
2008
141views more  JMLR 2008»
13 years 9 months ago
Graphical Methods for Efficient Likelihood Inference in Gaussian Covariance Models
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...
Mathias Drton, Thomas S. Richardson
ALGORITHMICA
2002
159views more  ALGORITHMICA 2002»
13 years 8 months ago
Algorithmic Aspects of Acyclic Edge Colorings
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...
Noga Alon, Ayal Zaks
JCO
2010
97views more  JCO 2010»
13 years 7 months ago
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence
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...
Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski
GLOBECOM
2007
IEEE
14 years 3 months ago
Cellular Communication with Randomly Placed Distributed Antennas
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...
Jun Zhang, Jeffrey G. Andrews