328 search results - page 6 / 66 » Simple Termination Revisited |
ICPADS
2002
IEEE
14 years 13 days ago
2002
IEEE
Efficient determination of processing termination at barrier synchronization points can occupy an important role in the overall throughput of parallel and distributed computing sy...
EVOW
2010
Springer
14 years 2 months ago
2010
Springer
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
FC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. At FC'05, Chen et al. introduced an elegant privacy protecting coupon (PPC) system, CESSS05 [13], in which users can purchase multi-coupons and redeem them unlinkabl...
PPOPP
2011
ACM
12 years 10 months ago
2011
ACM
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...