6437 search results - page 611 / 1288 » Parallel Algorithms for Arrangements |
174
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
206
click to vote
ICPP
1999
IEEE
15 years 11 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
358
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
226
click to vote
ESCIENCE
2006
IEEE
16 years 1 months ago
2006
IEEE
Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise th...
225
click to vote
RTCSA
2003
IEEE
16 years 17 days ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...