5699 search results - page 91 / 1140 » Alternating model trees |
140
Voted
FPL
2004
Springer
16 years 4 days ago
2004
Springer
Dynamically reconfigurable co-processors (DRCs) are interesting design alternatives when both flexibility and performance are concerns. However, it is difficult to study the perfor...
187
click to vote
EUROPAR
2005
Springer
16 years 8 days ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
168
click to vote
WINE
2005
Springer
16 years 6 days ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
206
Voted
PLDI
2012
ACM
13 years 9 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
184
click to vote
ICALP
2004
Springer
16 years 4 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...