1368 search results - page 222 / 274 » Avoiding Simplicity Is Complex |
HPCA
2006
IEEE
16 years 2 months ago
2006
IEEE
We propose dynamic scheduler designs to improve the scheduler scalability and reduce its complexity in the SMT processors. Our first design is an adaptation of the recently propos...
120
click to vote
CADE
2007
Springer
16 years 2 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
106
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
207
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
191
click to vote
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...