412 search results - page 22 / 83 » A New Proof of the F5 Algorithm |
149
Voted
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
142
click to vote
SODA
1998
ACM
15 years 6 months ago
1998
ACM
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
128
Voted
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchan...
151
Voted
CSFW
1999
IEEE
15 years 9 months ago
1999
IEEE
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
133
click to vote
SIAMCOMP
2002
15 years 4 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...