合 作 者
期刊 & 会议
年  份
F. Barber 的论文(99) 排序方式:
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts  
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled temporal algebra and its......
Journal of Artificial Intelligence Research  2000
20次引用 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
A Metric Time-Point and Duration-Based Temporal Model  
Constraint-based formalisms are a useful and common way to deal with temporal reasoning tasks. Assertions represent temporal constraints between temporal objects, time-points or intervals. Metric temp......
Intelligence  1993
16次引用 0 0
Distributing Constraints by Sampling in Non-Binary CSPs  
Nowadays, many real problems can be modeled as Constraint Satisfaction Problems (CSPs). Generally, these problems are solved by search algorithms, which require an order in which variables and values ......
IJCAI Workshop on Distributing Constraint Reasoning  2003
10次引用 0 0
Scheduling in a Planning Environment  
Abstract. In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan. This requ......
Workshop Planen und Konfigurieren  2000
10次引用 0 0
A Constraint Ordering Heuristic For Scheduling Problems  
 2003
9次引用 0 0
An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm  
Constraint programming is gaining a great deal of a ttention because many combinatorial problems especially in areas of planning and scheduling can be expressed in a natural way as a Constraint S atis......
Principles and Practice of Constraint Programming  2001
9次引用 0 0
Temporal Reasoning in REAKT: An Environment for Real-Time Knowledge-Based Systems  
Ai Communications  1994
8次引用 0 0
Constraint Satisfaction by Means of Dynamic Polyhedra  
Nowadays, many real problems in the Artificial Intelligence environments, can be efficiently modelled as Constraint Satisfaction Problems (CSP's) and can be solved by means of Operational Research tec......
 2001
8次引用 0 0
Distributed CSPs by graph partitioning  
Nowadays, many real problems in artificial intelligence can be modelled as constraint satisfaction problems (CSPs). A general CSP is known to be NP-complete. Nevertheless, distributed models may reduc......
Applied Mathematics and Computation  2006
8次引用 0 0

1/10 第一页 上一页 1 2 3 4 5 6 7 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜