4451 search results - page 58 / 891 » On Random Ordering Constraints |
180
click to vote
JPDC
2010
15 years 24 days ago
2010
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
146
click to vote
STOC
1990
ACM
15 years 10 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
187
click to vote
SAT
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
127
click to vote
AAAI
1998
15 years 7 months ago
1998
Wedefine an algebra of ternary relations for cyclic ordering of 2Dorientations. Thealgebra (1) is a refinement of the CYCORDtheory; (2) contains 24 atomic relations, hence 224 gen...
145
click to vote
WOLLIC
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...