This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the first semantics, ...
详细信息
ETL tools are responsible for the extraction of data from sources, their cleansing and loading into a target data warehouse. However, nowadays, the design and development of ETL processes are performed in an in-house ...
详细信息
It is well recognized that sequential pattern mining plays an essential role in many scientific and business domains. In this paper, a new extension of sequential pattern, attributes' sequential pattern, is propos...
详细信息
The use of the Internet raises serious behavioural issues regarding, for example, security and the interaction among agents that may travel across links. Model-building such interactive systems is one of the biggest c...
详细信息
Q-learning is an effective model-free reinforcement learning algorithm. However, Q-learning is centralized and competent only for single agent learning but not multi-agent learning because in later case the size of st...
详细信息
Q-learning is an effective model-free reinforcement learning algorithm. However, Q-learning is centralized and competent only for single agent learning but not multi-agent learning because in later case the size of state-action space is huge and will grow exponentially with the number of agents increasing. In the paper we present a distributed Q-learning algorithm to solving this problem. In our algorithm, the tasks of learning optimal action policy are distributed to each agent in team but not a central agent. In order to reduce the size of action-state space of multi-agent team we introduce a state-action space sharing strategy of agent team, through which one agent in team can use the states already explored by other agents before and need not take time to explore these states again. Additionally, our algorithm has the ability to allocate sub-goals dynamically among agents according to environment changing, which can make agent team coordinate more efficiently. Experiments show the efficiency of our algorithm when it is applied to the benchmark problem of predator-prey pursuit game, also called pursuit game, in which a team of predators coordinate to capture a prey.
CP-networks provide a convenient means for expressing preferences in reasoning, but it is not good at handling preferences with hard constraints. The paper proposes a new approach, which transforms the CP-network with...
详细信息
CP-networks provide a convenient means for expressing preferences in reasoning, but it is not good at handling preferences with hard constraints. The paper proposes a new approach, which transforms the CP-network with hard constraints into one constraint hierarchy, therefore one could process preferences and constraints in a single formalism with fruitful constraint solving algorithms. Furthermore, illustrates it with some examples, proves that the transformation preserves the ceteris paribus property and presents some complexity results. Finally compares it with related work and concludes the paper.
Most of real-life scheduling problems are semi on-line scheduling,where we do not know all the time variables of jobs in ***,solving such dynamic problems is a hot topic of research in Constraint *** this paper we ana...
详细信息
Most of real-life scheduling problems are semi on-line scheduling,where we do not know all the time variables of jobs in ***,solving such dynamic problems is a hot topic of research in Constraint *** this paper we analyze the constraints in the semi on-line scheduling problems and introduce the concept of monotonic about constraints which appear in general dynamic constraint *** designed a generic dynamic constraint solving algorithm for solving the scheduling *** give an example of its application to semi on-line discrete resource-constrained scheduling problem(ship-loading problem).
This paper presents a new model to incorporate decision theory into Graphplan framework, which enables our planner to handle uncertainty and make decision to choose the optimal one among a set of hypothesis valid plan...
详细信息
This paper deals with the problem of osculatory rational interpolation. We discuss the existence of the osculatory rational interpolation function for the given interpolation data and construct the relative rational f...
详细信息
This paper deals with the problem of osculatory rational interpolation. We discuss the existence of the osculatory rational interpolation function for the given interpolation data and construct the relative rational function as it exists. Furthermore, we point out that the rational interpolation function exists for almost all given interpolation nodes and corresponding interpolation values. Finally some examples are presented.
In UML, a modeling language popularly used to describe models at different abstraction levels, sequence diagram and statechart are both used to represent systems' behavior models. A consistency problem may arise d...
详细信息
In UML, a modeling language popularly used to describe models at different abstraction levels, sequence diagram and statechart are both used to represent systems' behavior models. A consistency problem may arise due to the fact that sequence diagram represent interactive behavior of all objects, whereas statechart represent the complete behavior of one specific object. This paper proposes an approach checking the consistency between sequence diagrams and state diagrams. In our approach, statechart is formalized using finite state processes and sequence diagram is represented using messages trace. An existing tool LTSA is used to support our method.
暂无评论