Sciweavers

JCSS
2008
138views more  JCSS 2008»
14 years 17 days ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
JCSS
2008
63views more  JCSS 2008»
14 years 17 days ago
Approximation of satisfactory bisection problems
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
JCSS
2008
80views more  JCSS 2008»
14 years 17 days ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
JCSS
2008
65views more  JCSS 2008»
14 years 17 days ago
Efficient algorithms for counting parameterized list H-colorings
Josep Díaz, Maria J. Serna, Dimitrios M. Th...
JCSS
2008
90views more  JCSS 2008»
14 years 17 days ago
Fault tolerance in cellular automata at high fault rates
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
Mark McCann, Nicholas Pippenger
JCSS
2008
81views more  JCSS 2008»
14 years 17 days ago
A simulator for adaptive parallel applications
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch