Sciweavers

6142 search results - page 497 / 1229
» The Complexity of Partition Functions
Sort
View
EOR
2008
119views more  EOR 2008»
15 years 7 months ago
Market sharing dynamics between two service providers
We study the market partition between two distinct firms that deliver services to waiting time sensitive customers. In our model, the incoming customers select a firm on the basis...
Olivier Gallay, Max-Olivier Hongler
INFORMS
2008
55views more  INFORMS 2008»
15 years 7 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 months ago
Relations between random coding exponents and the statistical physics of random codes
The partition function pertaining to finite–temperature decoding of a (typical) randomly chosen code is known to have three types of behavior, corresponding to three phases in ...
Neri Merhav
PR
2008
169views more  PR 2008»
15 years 6 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...
PAAPP
2006
44views more  PAAPP 2006»
15 years 6 months ago
Revisiting communication code generation algorithms for message-passing systems
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
Clayton S. Ferner