Sciweavers

4544 search results - page 352 / 909
» Reinforcement Learning with Time
Sort
View
CIA
2006
Springer
15 years 8 months ago
Learning to Negotiate Optimally in Non-stationary Environments
Abstract. We adopt the Markov chain framework to model bilateral negotiations among agents in dynamic environments and use Bayesian learning to enable them to learn an optimal stra...
Vidya Narayanan, Nicholas R. Jennings
FLAIRS
1998
15 years 5 months ago
Lazy Transformation-Based Learning
Weintroduce a significant improvementfor a relatively newmachine learning methodcalled Transformation-Based Learning. By applying a MonteCarlo strategy to randomly sample from the...
Ken Samuel
FOCS
2008
IEEE
15 years 11 months ago
Hardness of Minimizing and Learning DNF Expressions
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
Subhash Khot, Rishi Saket
ICIW
2008
IEEE
15 years 11 months ago
Web Contents Tracking by Learning of Page Grammars
A significant fraction of Web data is available only for short periods of time. We consider methods to keep track and to record such dynamic information automatically. The main p...
Dirk Kukulenz, Christoph Reinke, Nils Hoeller
TMC
2008
123views more  TMC 2008»
15 years 4 months ago
Learning Adaptive Temporal Radio Maps for Signal-Strength-Based Location Estimation
In wireless networks, a client's locations can be estimated using signal strength received from signal transmitters. Static fingerprint-based techniques are commonly used for ...
Jie Yin, Qiang Yang, Lionel M. Ni