Communicating sequential processes
Communicating sequential processes
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Do the right thing: studies in limited rationality
Do the right thing: studies in limited rationality
Handbook of theoretical computer science (vol. A): algorithms and complexity
Handbook of theoretical computer science (vol. A): algorithms and complexity
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Elements of interaction: Turing award lecture
Communications of the ACM
C4.5: programs for machine learning
C4.5: programs for machine learning
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
A calculus of mobile processes, I
Information and Computation
CSA: in the direction of greater representational power for neurocomputing
Journal of Parallel and Distributed Computing
Operational rationality through compilation of anytime algorithms
Operational rationality through compilation of anytime algorithms
Models of massive parallelism: analysis of cellular automata and neural networks
Models of massive parallelism: analysis of cellular automata and neural networks
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Automatic correlation and calibration of noisy sensor readings using elite genetic algorithms
Artificial Intelligence
Why interaction is more powerful than algorithms
Communications of the ACM
Interactive foundations of computing
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Multi-sensor fusion: fundamentals and applications with software
Multi-sensor fusion: fundamentals and applications with software
Artificial intelligence: a new synthesis
Artificial intelligence: a new synthesis
Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
Proof, language, and interaction: essays in honour of Robin Milner
Proof, language, and interaction: essays in honour of Robin Milner
How to solve it: modern heuristics
How to solve it: modern heuristics
Computational tradeoffs under bounded resources
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Artificial Life: An Overview
Designing Autonomous Agents: Theory and Practice from Biology to Engineering and Back
Designing Autonomous Agents: Theory and Practice from Biology to Engineering and Back
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
Machine Learning and Data Mining; Methods and Applications
Machine Learning and Data Mining; Methods and Applications
Feature Selection for Knowledge Discovery and Data Mining
Feature Selection for Knowledge Discovery and Data Mining
Handbook of Process Algebra
Knowledge Discovery and Data Mining: The Info-Fuzzy Network (Ifn) Methodology
Knowledge Discovery and Data Mining: The Info-Fuzzy Network (Ifn) Methodology
Controlling Autonomous Robots with GOLOG
AI '97 Proceedings of the 10th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Flexible Optimization and Evolution of Underwater Autonomous Agents
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Expressiveness of $-Calculus: What Matters?
Proceedings of the IIS'2000 Symposium on Intelligent Information Systems
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Dynamic Programming
A Generic Tool for Distributed AI with Matching as Message Passing
ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Robust sensor fusion algorithms: calibration and cost minimization
Robust sensor fusion algorithms: calibration and cost minimization
Alan Turing: Life and Legacy of a Great Thinker
Alan Turing: Life and Legacy of a Great Thinker
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Theoretical Computer Science
Approximate reasoning in the algebra of bounded rational agents
International Journal of Approximate Reasoning
Hi-index | 0.00 |
This paper presents a novel model for resource bounded computation based on process algebras. Such model is called the $-calculus (cost calculus). Resource bounded computation attempts to find the best answer possible given operational constraints. The $-calculus provides a uniform representation for optimization in the presence of limited resources. It uses cost-optimization to find the best quality solutions while using a minimal amount of resources. A unique aspect of the approach is to propose a resource bounded process algebra as a generic problem solving paradigm targeting interactive AI applications. The goal of the $-calculus is to propose a computational model with built-in performance measure as its central element. This measure allows not only the expression of solutions, but also provides the means to incrementally construct solutions for computationally hard, real-life problems. This is a dramatic contrast with other models like Turing machines, λ-calculus, or conventional process algebras. This highly expressive model must therefore be able to express approximate solutions. This paper describes the syntax and operational cost semantics of the calculus. A standard cost function has been defined for strongly and weakly congruent cost expressions. Example optimization problems are given which take into account the incomplete knowledge and the amount of resources used by an agent. The contributions of the paper are twofold: firstly, some necessary conditions for achieving global optimization by performing local optimization in time and/or space are found. That deals with incomplete information and complexity during problem solving. Secondly, developing an algebra which expresses current practices, e.g., neural nets, cellular automata, dynamic programming, evolutionary computation, or mobile robotics as limiting cases, provides a tool for exploring the theoretical underpinnings of these methods. As the result, hybrid methods can be naturally expressed and developed using the algebra.