• Home
  • About
  • A Brief History of AI
  • AI-Alerts
  • AI Magazine
  • AAAI Conferences
  • NeurIPS
  • Books
  • Classics

Scalable Planning with Tensorflow for Hybrid Nonlinear Domains

Ga Wu, Buser Say, Scott Sanner

Nov-21-2025, 11:56:27 GMT–Neural Information Processing Systems 

RMSProp avoids both the vanishing and exploding gradient problems.

  artificial intelligence, machine learning, planning & scheduling, (17 more...)

Neural Information Processing Systems

Nov-21-2025, 11:56:27 GMT

Conferences    PDF

Add feedback

  • Country:
    • Europe
      • Finland > Uusimaa
        • Helsinki (0.04)
      • Italy > Lazio
        • Rome (0.04)
    • North America
      • Canada > Ontario
        • Toronto (0.14)
      • United States
        • Arizona > Maricopa County
          • Phoenix (0.04)
        • California
          • Alameda County > Berkeley (0.04)
          • Los Angeles County > Long Beach (0.04)
        • Massachusetts > Middlesex County
          • Cambridge (0.04)
        • New Hampshire > Rockingham County
          • Portsmouth (0.04)
    • South America > Brazil
      • São Paulo (0.04)
  • Industry:
    • Energy (0.46)
    • Information Technology (0.46)
  • Technology:
    • Information Technology > Artificial Intelligence
      • Machine Learning
        • Neural Networks (0.99)
        • Statistical Learning > Gradient Descent (0.32)
      • Representation & Reasoning
        • Optimization (1.00)
        • Planning & Scheduling (1.00)

  • By text
  • By views
  • By concept tags

Duplicate Docs Excel Report

Title
Scalable Planning with Tensorflow for Hybrid Nonlinear Domains
Scalable Planning with Tensorflow for Hybrid Nonlinear Domains

Similar Docs  Excel Report  more

TitleSimilaritySource
None found

Site Feedback

© 2026, i2k Connect Inc  ·  All Rights Reserved.
Privacy policy  ·  Terms of use  ·  License  ·  Legal Notices
This is i2kweb version 7.1.0-SNAPSHOT. Logged in as aitopics-guest for 59 more minutes (idle timeout).

Site Feedback

powered by
i2k Connect

aitopics.org uses cookies to deliver the best possible experience. By continuing to use this site, you consent to the use of cookies. Learn more »

Add feedback

Send feedback to help us improve this new enhanced search experience.

Thank You!