Sciweavers

82 search results - page 7 / 17
» mst 2006
Sort
View
MST
2002
113views more  MST 2002»
13 years 7 months ago
Diffusion Schemes for Load Balancing on Heterogeneous Networks
Several different diffusion schemes have previously been developed for load balancing on homogeneous processor networks. We generalize existing schemes, in order to deal with heter...
Robert Elsässer, Burkhard Monien, Robert Prei...
MST
2002
97views more  MST 2002»
13 years 7 months ago
Programmed Mutagenesis Is Universal
Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that...
Julia Khodor, David K. Gifford
MST
2010
121views more  MST 2010»
13 years 5 months ago
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
Stasys Jukna
MST
2010
83views more  MST 2010»
13 years 5 months ago
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
MST
2010
98views more  MST 2010»
13 years 5 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis