92 search results - page 2 / 19 » An Optimal Lower Bound on the Number of Variables for Graph ... |
ISAAC
2010
Springer
13 years 4 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
CC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
ISSS
2000
IEEE
13 years 11 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...