Sciweavers

    ICML
    1999
    IEEE
    156views Machine Learning» more  ICML 1999»
    Approximation Via Value Unification
    14 years 8 months ago
    Approximation Via Value Unification
    Download  www-lrn.cs.umass.edu
    : Numerical function approximation over a Boolean domain is a classical problem with wide application to data modeling tasks and various forms of learning. A great many function ap...
    Paul E. Utgoff, David J. Stracuzzi
    claim paper
    Read More »
    ICML
    1999
    IEEE
    163views Machine Learning» more  ICML 1999»
    Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
    14 years 8 months ago
    Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
    Download  www.ri.cmu.edu
    We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
    Sebastian Thrun, John Langford, Dieter Fox
    claim paper
    Read More »
    ICML
    1999
    IEEE
    191views Machine Learning» more  ICML 1999»
    Active Learning for Natural Language Parsing and Information Extraction
    14 years 8 months ago
    Active Learning for Natural Language Parsing and Information Extraction
    Download  www.cs.utexas.edu
    Cynthia A. Thompson, Mary Elaine Califf, Raymond J...
    claim paper
    Read More »
    ICML
    1999
    IEEE
    152views Machine Learning» more  ICML 1999»
    Distributed Value Functions
    14 years 8 months ago
    Distributed Value Functions
    Download  www.ri.cmu.edu
    Many interesting problems, such as power grids, network switches, and tra c ow, that are candidates for solving with reinforcement learningRL, alsohave properties that make distri...
    Jeff G. Schneider, Weng-Keen Wong, Andrew W. Moore...
    claim paper
    Read More »
    ICML
    1999
    IEEE
    138views Machine Learning» more  ICML 1999»
    Using Reinforcement Learning to Spider the Web Efficiently
    14 years 8 months ago
    Using Reinforcement Learning to Spider the Web Efficiently
    Download  www.cs.iastate.edu
    Consider the task of exploring the Web in order to find pages of a particular kind or on a particular topic. This task arises in the construction of search engines and Web knowled...
    Jason Rennie, Andrew McCallum
    claim paper
    Read More »
    ICML
    1999
    IEEE
    129views Machine Learning» more  ICML 1999»
    Implicit Imitation in Multiagent Reinforcement Learning
    14 years 8 months ago
    Implicit Imitation in Multiagent Reinforcement Learning
    Download  www.cs.toronto.edu
    Imitation is actively being studied as an effective means of learning in multi-agent environments. It allows an agent to learn how to act well (perhaps optimally) by passively obs...
    Bob Price, Craig Boutilier
    claim paper
    Read More »
    ICML
    1999
    IEEE
    107views Machine Learning» more  ICML 1999»
    Learning Policies with External Memory
    14 years 8 months ago
    Learning Policies with External Memory
    Download  reference.kfupm.edu.sa
    Leonid Peshkin, Nicolas Meuleau, Leslie Pack Kaelb...
    claim paper
    Read More »
    ICML
    1999
    IEEE
    97views Machine Learning» more  ICML 1999»
    Policy Invariance Under Reward Transformations: Theory and Application to Reward Shaping
    14 years 8 months ago
    Policy Invariance Under Reward Transformations: Theory and Application to Reward Shaping
    Download  cseweb.ucsd.edu
    Andrew Y. Ng, Daishi Harada, Stuart J. Russell
    claim paper
    Read More »
    ICML
    1999
    IEEE
    114views Machine Learning» more  ICML 1999»
    Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
    14 years 8 months ago
    Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
    Download  www.cs.iastate.edu
    E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
    Rajesh Parekh, Vasant Honavar
    claim paper
    Read More »
    ICML
    1999
    IEEE
    108views Machine Learning» more  ICML 1999»
    Detecting Motifs from Sequences
    14 years 8 months ago
    Detecting Motifs from Sequences
    Download  www.ics.uci.edu
    The problemofmultipleglobalcomparisonin familiesof biologicalsequences has been wellstudied. Fewer algorithms have been developed for identifying local consensus patterns or motif...
    Yuh-Jyh Hu, Suzanne B. Sandmeyer, Dennis F. Kibler
    claim paper
    Read More »
    « first‹ previous…241242243244245246247248249…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.