Sciweavers

5981 search results - page 837 / 1197
» time 2006
Sort
View
RECOMB
2006
Springer
16 years 7 months ago
Predicting Experimental Quantities in Protein Folding Kinetics Using Stochastic Roadmap Simulation
Abstract. This paper presents a new method for studying protein folding kinetics. It uses the recently introduced Stochastic Roadmap Simulation (SRS) method to estimate the transit...
Tsung-Han Chiang, Mehmet Serkan Apaydin, Douglas L...
CADE
2006
Springer
16 years 7 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
CADE
2006
Springer
16 years 7 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 7 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
16 years 7 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman