1389 search results - page 120 / 278 » Parallel Algorithms for Treewidth Two |
ICDCSW
2005
IEEE
15 years 3 months ago
2005
IEEE
Content-based event matching is an important problem in large-scale event-based publish/subscribe systems. However, open questions remain in ...
SKG
2005
IEEE
15 years 3 months ago
2005
IEEE
Efficient task scheduling is critical to achieving high performance on grid computing environment. A heuristic task scheduling algorithm satisfied resources load balancing on grid ...
125
click to vote
ANCS
2009
ACM
14 years 8 months ago
2009
ACM
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since ...