1191 search results - page 142 / 239 » Completeness and Performance Of The APO Algorithm |
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...
TON
2008
14 years 10 months ago
2008
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
WISEC
2009
ACM
15 years 4 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...