1449 search results - page 211 / 290 » Self-Randomized Exponentiation Algorithms |
148
click to vote
CSR
2007
Springer
16 years 10 days ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
172
click to vote
CGO
2006
IEEE
16 years 7 days ago
2006
IEEE
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
150
click to vote
APPROX
2007
Springer
16 years 11 days ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
178
click to vote
KI
2007
Springer
16 years 9 days ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
162
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...