348 search results - page 10 / 70 » Using Constraint Networks on Timelines to Model and Solve Pl... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
CONSTRAINTS
1998
13 years 7 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is t...
AAAI
2008
13 years 9 months ago
2008
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
AIPS
1998
13 years 8 months ago
1998
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...