6437 search results - page 909 / 1288 » Parallel Algorithms for Arrangements |
165
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
165
click to vote
ICDAR
1997
IEEE
15 years 11 months ago
1997
IEEE
An algorithm is presented that allows to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided int...
186
click to vote
LICS
1990
IEEE
15 years 10 months ago
1990
IEEE
E cient automatic model checking algorithms for real-time systems have been obtained in recent years based on the state region graph technique of Alur, Courcoubetis and Dill. Howev...
182
click to vote
3DPVT
2006
IEEE
15 years 10 months ago
2006
IEEE
Thanks to their high performance and programmability, the latest graphics cards can now be used for scientific purpose. They are indeed very efficient parallel Single Instruction ...
188
click to vote
DEXAW
2004
IEEE
15 years 10 months ago
2004
IEEE
To achieve correct execution of peer-to-peer applications on non-reliable resources, we present a portable and distributed algorithm that provides fault tolerance and result checki...