2814 search results - page 43 / 563 » Competitive Analysis of Distributed Algorithms |
DAPSYS
2004
Springer
14 years 3 months ago
2004
Springer
The multi-phase copying garbage collection was designed to avoid the need for large amount of reserved memory usually required for the copying types of garbage collection algorithm...
JAIR
2008
13 years 10 months ago
2008
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
ISPDC
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
ACL
2010
13 years 8 months ago
2010
This work models Word Sense Disambiguation (WSD) problem as a Distributed Constraint Optimization Problem (DCOP). To model WSD as a DCOP, we view information from various knowledg...
PIMRC
2008
IEEE
14 years 4 months ago
2008
IEEE
ACT We consider a cognitive radio scenario in which two (or more) operators providing services in the same area wish to share the same licensed band of spectrum. This scenario diff...