156 search results - page 22 / 32 » Parallel SAT Solving using Bit-level Operations |
ICDCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...
CDES
2008
13 years 9 months ago
2008
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
IDEAS
2000
IEEE
14 years 21 hour ago
2000
IEEE
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...
AAAI
1990
13 years 8 months ago
1990
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
IEEECGIV
2009
IEEE
14 years 2 months ago
2009
IEEE
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...