6142 search results - page 134 / 1229 » The Complexity of Partition Functions |
SIGMETRICS
2009
ACM
15 years 4 months ago
2009
ACM
We consider the problem of designing scheduling algorithms for the downlink of cellular wireless networks where bandwidth is partitioned into tens to hundreds of parallel channels...
NAR
2008
14 years 10 months ago
2008
DNA-binding domain (DBD) is a database of predicted sequence-specific DNA-binding transcription factors (TFs) for all publicly available proteomes. The proteomes have increased fr...
NCA
2007
IEEE
14 years 9 months ago
2007
IEEE
Learning from imbalanced data occurs frequently in many machine learning applications. One positive example to thousands of negative instances is common in scientific applications...
DAGSTUHL
2003
14 years 11 months ago
2003
Individual functional requirements represent fragments of behavior, while a design that satisfies a set of functional requirements represents integrated behavior. This perspective ...
130
click to vote
WINE
2010
Springer
14 years 7 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...