منابع مشابه
Object-oriented BeNet programming for data-focused bottom-up design of autonomous agents
In this paper, we propose an approach to developing autonomous agents that behave intelligently in unpredictable environments and a programming method for describing such agents. In our data-focused bottom-up design, the designer develops an intelligent agent as a program which updates a nite set of data objects at regular intervals, modifying the description step by step to extend its behavior...
متن کاملComparing Two Bottom-up Database Design Methods
Bottom-up database design is a difficult task for novice database designers and is particularly challenging to teach. To address the problem, two methods—textbook and cookbook—have been suggested. The textbook method describes the Codd’s normalization algorithm and data model visualization adopted by most textbooks. The cookbook method illustrates a simple and straightforward normalization algo...
متن کاملOrganizations and Autonomous Agents: Bottom-Up Dynamics of Coordination Mechanisms
Agents in an organization need to coordinate their actions in order to reach the organizational goals. Organizational models specify the desired behaviour in terms of roles, relations, norms and interactions. In this research, we show how organizational rules can be adopted by autonomous agents. We have developed a method to translate norms into reasoning rules for agents. However, since the ag...
متن کاملBuilding Software Process Line Architectures from Bottom Up
Abstract. In this paper, we propose a technique for establishing process lines, which are sets of common processes in particular problem domains, and process line architectures that incorporate commonality and variability. Process line architectures are used as a basis for deriving process lines from the perspective of overall optimization. The proposed technique includes some extensions to the...
متن کاملPolicy Expressions and the Bottom-Up Design of Computing Policies
A policy is a sequence of rules, where each rule consists of a predicate and a decision, and where each decision is either “accept” or “reject”. A policy P is said to accept (or reject, respectively) a request iff the decision of the first rule in P , that matches the request is “accept” (or “reject”, respectively). Examples of computing policies are firewalls, routing policies and software-def...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1994
ISSN: 0001-0782,1557-7317
DOI: 10.1145/176789.176805