10805 search results - page 278 / 2161 » Mapping Computation with No Memory |
151
click to vote
ICDCS
2006
IEEE
16 years 22 days ago
2006
IEEE
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...
141
click to vote
ICRA
2006
IEEE
16 years 21 days ago
2006
IEEE
— Due to the abundant application background, the optimization of maintenance problem has been extensively studied in the past decades. Besides the well-known difficulty of larg...
194
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper presents a scalable method for parallel symbolic on-the-fly model checking in a distributed memory environment. Our method combines a scheme for on-the-fly mod...
192
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
The growing importance of ontology mapping on the Semantic Web has highlighted the need to manage the uncertain nature of interpreting semantic meta data represented by heterogeneo...
180
click to vote
EGH
2007
Springer
16 years 25 days ago
2007
Springer
Logarithmic shadow maps can deliver the same quality as competing shadow map algorithms with substantially less storage and bandwidth. We show how current GPU architectures can be...