Sciweavers

9166 search results - page 409 / 1834
» A framework for comparing models of computation
Sort
View
FORTE
2010
15 years 8 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri
ASM
2005
ASM
16 years 10 days ago
Time in State Machines
State machines are considered a very general means of expressing computations in an implementation-independent way. There are also ways to extend the general state machine framewor...
Susanne Graf, Andreas Prinz
BMCBI
2008
87views more  BMCBI 2008»
15 years 6 months ago
Volume-based solvation models out-perform area-based models in combined studies of wild-type and mutated protein-protein interfa
Background: Empirical binding models have previously been investigated for the energetics of protein complexation (G models) and for the influence of mutations on complexation (i....
Salim Bougouffa, Jim Warwicker
WWW
2005
ACM
16 years 7 months ago
Incremental page rank computation on evolving graphs
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
Prasanna Kumar Desikan, Nishith Pathak, Jaideep Sr...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 8 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...