8810 search results - page 1590 / 1762 » Open. Closed. Open |
197
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
185
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
174
click to vote
SIGMETRICS
2010
ACM
15 years 11 months ago
2010
ACM
We present S, the first system to provide transparent, lowoverhead application record-replay and the ability to go live from replayed execution. S i...
170
click to vote
SIGMETRICS
2010
ACM
15 years 11 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
243
click to vote
BICOB
2010
Springer
15 years 11 months ago
2010
Springer
We present a grid-enabled problem solving environment (PSE), for multidimensional QTL analysis. The concept of a computational grid has not been fully realized within this and oth...