3906 search results - page 276 / 782 » From grids to places |
171
click to vote
CAEPIA
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
133
click to vote
DAC
1993
ACM
15 years 10 months ago
1993
ACM
We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...
146
click to vote
WSC
2007
15 years 9 months ago
2007
We discuss design issues related to the transformation of a mature Agent-Based Model (ABM) for computational epidemiology into a “grid-aware” version. EpiSims is a distributed...
151
click to vote
CCCG
2008
15 years 8 months ago
2008
We give a very short proof of the following result of Graham from 1980: For any finite coloring of Rd , d 2, and for any > 0, there is a monochromatic (d + 1)-tuple that span...
170
click to vote
CONCURRENCY
2006
15 years 6 months ago
2006
In this paper, we examine the issues of workflow mapping and execution in opportunistic environments such as the grid. As applications become ever more complex, the process of cho...