Sciweavers

38 search results - page 4 / 8
» Effective Approaches for Partial Satisfaction (Over-Subscrip...
Sort
View
PUK
2000
13 years 7 months ago
Scheduling in a Planning Environment
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....
Antonio Garrido Tejero, Miguel A. Salido, Federico...
PRICAI
2004
Springer
13 years 11 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
AAAI
2010
13 years 7 months ago
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
Miquel Ramírez, Hector Geffner
ICAIL
2009
ACM
14 years 8 days ago
Reasoning with spatial plans on the semantic web
ct Land use regulations are an important but often underrated legal domain. Especially in densely populated regions such as the Netherlands, spatial plans have a profound impact on...
Rinke Hoekstra, Radboud Winkels, Erik Hupkes
AIPS
2008
13 years 8 months ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams