类 型
10 篇文献
 
Feasible Distributed CSP Models for Scheduling Problems ∗  
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple au......
0次引用 0 0
Distributed Constraint Satisfaction Problems to Model Railway Scheduling Problems  
Railway Scheduling is considered to be a difficult and time-consuming task. This is due to real railway networks can be modelled as Constraint Satisfaction Problems (CSPs), but they require a huge num......
0次引用 0 0
www.elsevier.com/locate/knosys Domain-dependent distributed models for railway scheduling q  
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usually used. However, man......
0次引用 0 0
Distributed Constraints for Large-Scale Scheduling Problems  
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed models may re- duce t......
Principles and Practice of Constraint Programming  2005
0次引用 0 0
Feasible distributed CSP models for scheduling problems  
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple au......
Engineering Applications of Artificial Intelligence  2008
0次引用 0 0
Exploiting the Constrainedness in Constraint Satisfaction Problems  
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardest part of a search ......
Artificial Intelligence: Methodology, Systems, Applications  2004
2次引用 0 0
Domain-dependent distributed models for railway scheduling  
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usually used. However, man......
Knowledge Based Systems  2007
5次引用 0 0
Domain-Dependent Distributed Models for Railway Scheduling*  
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usually used. However, man......
2次引用 0 0
Managing Complex Scheduling Problems with Dynamic and Hybrid Constraints  
3次引用 0 0
Constrainedness and Redundancy by Constraint Ordering  
In constraint satisfaction, a general rule is to tackle the hard- est part of a search problem first. In this paper, we introduce a parameter (¿) that measures the constrainedness of a search problem.......
Ibero-American Conference on AI  2004
0次引用 0 0

Feedback
Feedback
Feedback
我想反馈:
排行榜