Sciweavers

518 search results - page 52 / 104
» Beating a Random Assignment
Sort
View
APSCC
2007
IEEE
15 years 9 months ago
An Agent Scheduling Optimization for Call Centers
A suitable assignment of agents to handle the workload at a call center is not easy to fulfill because it requires a combinatorial optimization with large solution space and the n...
Chiaki Hishinuma, Masaaki Kanakubo, Takuma Goto
117
Voted
ICC
2007
IEEE
197views Communications» more  ICC 2007»
15 years 8 months ago
A Distributed Scheduling Algorithm for Multiuser MIMO Systems with 1-bit SINR Feedback
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
Stefano Sorrentino, Umberto Spagnolini, Lino Moret...
ICC
2007
IEEE
117views Communications» more  ICC 2007»
15 years 8 months ago
Price Negotiation Systems for M-commerce
— As content delivery to wireless devices becomes faster and scalable, it is likely that mobile commerce will constitute a significant portion of digital commerce. In markets, b...
Huafei Zhu, Feng Bao, A. Lakshminarayanan
INFOCOM
2003
IEEE
15 years 7 months ago
A Novel Mechanism for Contention Resolution in HFC Networks
Abstract— The Medium Access Control (MAC) scheme proposed by DAVIC/DVB, IEEE 802.14 and DOCSIS for the upstream channel of Hybrid Fiber Coaxial (HFC) access networks is based on ...
Mark Van den Broek, Ivo J. B. F. Adan, Saishankar ...
117
Voted
UAI
2004
15 years 3 months ago
Case-Factor Diagrams for Structured Probabilistic Modeling
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
David A. McAllester, Michael Collins, Fernando Per...