Sciweavers

544 search results - page 16 / 109
» What cannot be computed locally!
Sort
View
DCOSS
2010
Springer
13 years 12 months ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....
FOSSACS
2005
Springer
14 years 2 months ago
Foundations of Web Transactions
A timed extension of π-calculus with a transaction construct – the calculus webπ – is studied. The underlying model of webπ relies on networks of processes; time proceeds as...
Cosimo Laneve, Gianluigi Zavattaro
BMCBI
2007
115views more  BMCBI 2007»
13 years 8 months ago
Local comparison of protein structures highlights cases of convergent evolution in analogous functional sites
Background: We performed an exhaustive search for local structural similarities in an ensemble of non-redundant protein functional sites. With the purpose of finding new examples ...
Gabriele Ausiello, Daniele Peluso, Allegra Via, Ma...
POPL
2006
ACM
14 years 9 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
ACMSE
2007
ACM
14 years 17 days ago
Verifying design modularity, hierarchy, and interaction locality using data clustering techniques
Modularity, hierarchy, and interaction locality are general approaches to reducing the complexity of any large system. A widely used principle in achieving these goals in designin...
Liguo Yu, Srini Ramaswamy