810 search results - page 152 / 162 » Solving Time-Dependent Planning Problems |
AAAI
1994
13 years 9 months ago
1994
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
JSAT
2008
13 years 7 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
OSN
2008
13 years 7 months ago
2008
This paper presents a study on the Grade-of-Service (GoS) differentiation of static resource allocation in lightpath routed WDM networks, where lightpath requests between node pai...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...