Sciweavers

383 search results - page 29 / 77
» A Bound on the Total Chromatic Number
Sort
View
CDC
2010
IEEE
102views Control Systems» more  CDC 2010»
13 years 5 months ago
Stock market trading via stochastic network optimization
We consider the problem of dynamic buying and selling of shares from a collection of N stocks with random price fluctuations. To limit investment risk, we place an upper bound on t...
Michael J. Neely
ML
2002
ACM
121views Machine Learning» more  ML 2002»
13 years 10 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
CIE
2010
Springer
13 years 12 months ago
The Limits of Tractability in Resolution-Based Propositional Proof Systems
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the refutation system of Resolution and its generalisations with bounded conjunction, ...
Stefan S. Dantchev, Barnaby Martin
STACS
1999
Springer
14 years 2 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
POPL
2009
ACM
14 years 11 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...