6437 search results - page 902 / 1288 » Parallel Algorithms for Arrangements |
154
click to vote
KBSE
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a divide-and-conquer method, called DiConic, for automatic addition of failsafe fault-tolerance to distributed programs, where a failsafe program guarantees to meet its...
149
click to vote
COCO
2007
Springer
16 years 29 days ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
159
click to vote
EUROPAR
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle ar...
162
click to vote
EUROPAR
2007
Springer
16 years 28 days ago
2007
Springer
To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must ...
174
click to vote
PPAM
2007
Springer
16 years 27 days ago
2007
Springer
Nowadays, capturing the knowledge in ontological structures is one of the primary focuses of the semantic web research. To exploit the knowledge from the vast quantity of existing ...