Blog
About

39
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Flexible and Approximate Computation through State-Space Reduction

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          In the real world, insufficient information, limited computation resources, and complex problem structures often force an autonomous agent to make a decision in time less than that required to solve the problem at hand completely. Flexible and approximate computations are two approaches to decision making under limited computation resources. Flexible computation helps an agent to flexibly allocate limited computation resources so that the overall system utility is maximized. Approximate computation enables an agent to find the best satisfactory solution within a deadline. In this paper, we present two state-space reduction methods for flexible and approximate computation: quantitative reduction to deal with inaccurate heuristic information, and structural reduction to handle complex problem structures. These two methods can be applied successively to continuously improve solution quality if more computation is available. Our results show that these reduction methods are effective and efficient, finding better solutions with less computation than some existing well-known methods.

          Related collections

          Most cited references 15

          • Record: found
          • Abstract: not found
          • Article: not found

          A Computing Procedure for Quantification Theory

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Consistency in networks of relations

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The traveling-salesman problem and minimum spanning trees: Part II

                Bookmark

                Author and article information

                Journal
                1301.7418

                Artificial intelligence

                Comments

                Comment on this article

                Similar content 36,030