1450 search results - page 56 / 290 » On the Complexity of Hardness Amplification |
NETWORKS
2011
13 years 4 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
ATAL
2006
Springer
14 years 22 days ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
JBCB
2008
13 years 9 months ago
2008
Protein complexes are fundamental for understanding principles of cellular organizations. Accurate and fast protein complex prediction from the PPI networks of increasing sizes ca...
TCOM
2008
13 years 9 months ago
2008
Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum frontend detecti...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...