Amanote Research

Amanote Research

    RegisterSign In

Provably Bounded-Optimal Agents

Journal of Artificial Intelligence Research - United States
doi 10.1613/jair.133
Full Text
Open PDF
Abstract

Available in full text

Categories
Artificial Intelligence
Date

May 1, 1995

Authors
S. J. RussellD. Subramanian
Publisher

AI Access Foundation


Related search

A Provably Good Approximation Algorithm for Optimal-Time Trajectory Planning

English

Optimal Control of Ultimately Bounded Stochastic Processes

Nagoya Mathematical Journal
Mathematics
1974English

Optimal Time-Bounded Reachability Analysis for Concurrent Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Optimal Taxation With Behavioral Agents

American Economic Review
EconomicsEconometrics
2020English

Risk-Bounded Formation of Fuzzy Coalitions Among Service Agents

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots With Decoupled Dynamics Bounds

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1995English

Provably Correct Compiler Generation

DAIMI Report Series
1992English

An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2010English

Optimal Rejection of Bounded Persistent Disturbances in Periodic Systems

1990English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy