Sciweavers

477 search results - page 34 / 96
» Complexity Considerations, cSAT Problem Lower Bound
Sort
View
CATS
2007
13 years 10 months ago
Effective Prediction and its Computational Complexity
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
Richard Taylor
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 6 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
ITA
2000
13 years 8 months ago
Construction of very hard functions for multiparty communication complexity
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
Ján Manuch

Publication
222views
14 years 5 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
FOCS
2009
IEEE
14 years 3 months ago
The Data Stream Space Complexity of Cascaded Norms
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
T. S. Jayram, David P. Woodruff