类 型
20 篇文献
 
A Mixed Closure-CSP Method for Solving Scheduling Problems  
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-based methods which in......
Applied Intelligence  2004
3次引用 0 0
A Mixed Closure-CSP Method to Solve Scheduling Problems  
Abstract Scheduling problems can be seen as a set of temporal metric and disjunctive constraints.So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-based methods ......
1次引用 0 0
Integrating Planning and Scheduling  
Planning and scheduling research is becoming an increasingly interesting topic in the Artificial Intelligence area.........
Applied Artificial Intelligence  2001
18次引用 0 0
Efficient Solution Techniques for Disjunctive Temporal Reasoning Problems  
Over the past few years, a new constraint-based formalism for temporal reasoning has been developed to represent and reason about Disjunctive Temporal Problems (DTPs). The class of DTPs is significant......
18次引用 0 0
Importance of Flexibility in Manufacturing Systems  
Flexibility refers to the ability of a manufacturing system to respond cost effectively and rapidly to changing production needs and requirements. This capabil- ity is becoming increasingly important ......
0次引用 0 0
Primitive Intervals versus Point-Based Intervals: Rivals or Allies?  
The notion of time is a very interesting and exciting subject both in science and everyday life. One of the fundamental questions is: what is time composed of? While the traditional time structure is ......
The Computer Journal  2006
3次引用 0 0
A Literature Review on Artificial Intelligence  
Research on artificial intelligence in the last two decades has greatly improved perfor- mance of both manufacturing and service systems. Currently, there is a dire need for an article that presents a......
0次引用 0 0
Representation and reasoning with disjunctive temporal constraints TRACK 1: Temporal representation and reasoning in AI TOPIC: Temporal constraint reasoning  
The purpose of this paper is to show the expressiveness provided by the use of a Labelled TCSP model in order to specify and reason about disjunc- tive temporal constraints. We use a network based rep......
0次引用 0 0
CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning  
Temporal constraints pose a challenge for conditional planning, because it is necessary for a conditional planner to determine whether a candidate plan will satisfy the specified temporal constraints.......
6次引用 0 0
A Mixed Closure-CSP Method to Solve Scheduling Problems  
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-based methods which in......
Industrial and Engineering Applications of Artificial Intelligence and Expert Systems  2001
0次引用 0 0

1/2 第一页 上一页 1 2 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜