the temporal ccp model tcc [3] is aimed at specifying timed systems. Time is conceptually divided into discrete intervals. In a particular time interval, a ccp process receives a stimulus (i.e. a constraint)from the e...
ISBN:
(纸本)3540428631
the temporal ccp model tcc [3] is aimed at specifying timed systems. Time is conceptually divided into discrete intervals. In a particular time interval, a ccp process receives a stimulus (i.e. a constraint)from the environment, it executes withthis stimulus as the initial store, and when it reaches its resting point, it responds to the environment withthe resulting store. Also the resting point determines a residual process, which is then executed in the next time interval. this temporal ccp model is inherently deterministic and synchronous.
In constraint Optimization Problems (COP) the objective function induces a total order on the solution set. However, in many real-life applications, more functions, possibly conflicting, should be optimized at the sam...
ISBN:
(纸本)3540428631
In constraint Optimization Problems (COP) the objective function induces a total order on the solution set. However, in many real-life applications, more functions, possibly conflicting, should be optimized at the same time, and solutions are ranked by means of a Partial Order.
the most advanced implementation of adaptive constraint processing withconstraint Handling Rules (CHR) is introduced in the imperative object-oriented programming language Java. the presented Java implementation cons...
详细信息
作者：
Ringwelski, GeorgGMD FIRST
German National Research Center for Information Technology Kekuléstraße 7 Berlin12489 Germany
A constraint Satisfaction Problem (CSP) is to find an assignment to a set of variables that is consistent wrt. a set of constraints over these variables. CSPs frequentlyarise in applications of distributed artificial ...
ISBN:
(纸本)3540428631
A constraint Satisfaction Problem (CSP) is to find an assignment to a set of variables that is consistent wrt. a set of constraints over these variables. CSPs frequentlyarise in applications of distributed artificial intelligence [3] and may often not be solved bya centralized constraint solver for privacyor security reasons. In this distributed case (DCSP) constraints and variables are distributed among multiple automated agents.
constraint based techniques offer a promising approach to coordinating a set of agents in solving a distributed resource allocation problem. Distributed resource allocation is a general problem in which a set of agent...
ISBN:
(纸本)3540428631
constraint based techniques offer a promising approach to coordinating a set of agents in solving a distributed resource allocation problem. Distributed resource allocation is a general problem in which a set of agents must intelligently assign their resources to a set of tasks such that all tasks are performed with respect to certain criteria. this problem arises in many real-world domains such as distributed sensor networks [4], disaster rescue[2], hospital scheduling[1], and others.
We explore the problem of deriving explanations and implications for constraint satisfaction problems (CSPs). We show that consistency methods can be used to generate inferences that support both functions. Explanatio...
详细信息
A difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation and simplification algorithm. In previous work, different methods for automatic generation of propagation...
详细信息
the aircraft assignment (or tail assignment) problem is to determine the routes flown by each aircraft in a given fleet, such that each flight is included in exactly one route and the aircraft visit maintenance statio...
ISBN:
(纸本)3540428631
the aircraft assignment (or tail assignment) problem is to determine the routes flown by each aircraft in a given fleet, such that each flight is included in exactly one route and the aircraft visit maintenance stations according to regulations. Before this problem is solved, an airline has to: i) construct the timetable of flights, and ii) decide the aircraft type of each flight (fleet assignment). the aircraft assignment problem, thus, is a vehicle scheduling problem for a homogeneous fleet where all flight activities are fixed in time.
We present a constraint-based model and planning engine for manufacturing process planning. By exploiting the expressive power of constraintprogramming (CP), all relevant, sometimes conflicting pieces of domain knowl...
详细信息
A constraint satisfaction problem is a permutation problem if it has the same number of values as variables, all variables have the same domain and any solution assigns a permutation of the values to the variables. th...
详细信息
暂无评论