Sciweavers

Share
DMTCS
2011
261views Mathematics» more  DMTCS 2011»
8 years 5 months ago
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
Yury Person, Mathias Schacht
ML
2002
ACM
143views Machine Learning» more  ML 2002»
9 years 5 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
9 years 7 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
IPCO
2007
126views Optimization» more  IPCO 2007»
9 years 7 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
AAAI
2007
9 years 8 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
FSE
2006
Springer
174views Cryptology» more  FSE 2006»
9 years 9 months ago
Distinguishing Attacks on the Stream Cipher Py
The stream cipher Py designed by Biham and Seberry is a submission to the ECRYPT stream cipher competition. The cipher is based on two large arrays (one is 256 bytes and the other ...
Souradyuti Paul, Bart Preneel, Gautham Sekar
CP
2001
Springer
9 years 10 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
CSR
2010
Springer
9 years 10 months ago
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
Pawel Gawrychowski, Artur Jez, Lukasz Jez
FSTTCS
2003
Springer
9 years 11 months ago
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
Nikhil R. Devanur, Vijay V. Vazirani
CP
2004
Springer
9 years 11 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
books