Sciweavers

216 search results - page 17 / 44
» The Complexity of Planning Problems With Simple Causal Graph...
Sort
View
CP
2004
Springer
14 years 1 months ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...
FCT
2009
Springer
14 years 2 months ago
Computing Role Assignments of Chordal Graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...
AAAI
2007
13 years 10 months ago
On the Partial Observability of Temporal Uncertainty
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Michael D. Moffitt
GIS
2005
ACM
14 years 8 months ago
Contraflow network reconfiguration for evacuation planning: a summary of results
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
Sangho Kim, Shashi Shekhar
IJCAI
1989
13 years 8 months ago
An Adaptive Model of Decision-Making in Planning
Learning how to make decisions in a domain is a critical aspect of intelligent planning behavior. The ability of a planner to adapt its decision-making to a domain depends in part...
Gregg Collins, Lawrence Birnbaum, Bruce Krulwich