2703 search results - page 435 / 541 » Optimizing memory transactions |
104
click to vote
COCOON
2009
Springer
15 years 7 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...
118
click to vote
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
MPI Alltoall is one of the most communication intense collective operation used in many parallel applications. Recently, the supercomputing arena has witnessed phenomenal growth o...
SECON
2008
IEEE
15 years 7 months ago
2008
IEEE
—We present the design and implementation of UDAE, a Universal Data Access Engine for wireless sensor networks. The UDAE allows developers to access data both locally and over th...
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
116
click to vote
ICRA
2006
IEEE
15 years 7 months ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...