475 search results - page 19 / 95 » Feasible distributed CSP models for scheduling problems |
AIMSA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
PPSN
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
IPPS
2002
IEEE
14 years 12 days ago
2002
IEEE
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...
ICRA
2003
IEEE
14 years 23 days ago
2003
IEEE
— Multiple, independent robot platforms promise significant advantage with respect to robustness and flexibility. However, coordination between otherwise independent robots req...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...