835 search results - page 159 / 167 » Finding Optimal Solutions to Cooperative Pathfinding Problem... |
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
ADHOCNOW
2009
Springer
13 years 8 months ago
2009
Springer
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
PDPTA
2004
13 years 9 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we present a surprisingly simple yet powerful method for detecting illumination--determining which pixels are lit by different lights--in images. Our method is based...
ORL
2006
13 years 7 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...