7988 search results - page 1419 / 1598 » A Useful Undecidable Theory |
154
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
140
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
143
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
131
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
222
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...