5138 search results - page 484 / 1028 » Randomized Algorithms for 3-SAT |
188
click to vote
PPAM
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
162
click to vote
CSCLP
2004
Springer
16 years 9 days ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
185
click to vote
ESA
2004
Springer
16 years 9 days ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
218
click to vote
PARA
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
162
click to vote
DASFAA
2010
IEEE
16 years 7 days ago
2010
IEEE
This demonstration presents a recently proposed join algorithm called DigestJoin. Optimized for solid-state drives (SSDs), DigestJoin aims at reducing intermediate join results and...