1174 search results - page 218 / 235 » Optimizing generics is easy! |
SPAA
2003
ACM
14 years 4 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
SSDBM
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
IWLCS
2001
Springer
14 years 3 months ago
2001
Springer
In previous papers we have described the basic elements for building an economic model consisting of a group of artificial traders functioning and adapting in an environment conta...
PASTE
2010
ACM
14 years 2 months ago
2010
ACM
ROADRUNNER is a dynamic analysis framework designed to facilitate rapid prototyping and experimentation with dynamic analyses for concurrent Java programs. It provides a clean API...