Sciweavers

809 search results - page 155 / 162
» A Performance Analysis Framework for Mobile-Agent Systems
Sort
View
PLDI
2009
ACM
15 years 4 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
CN
2008
98views more  CN 2008»
14 years 10 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
BMCBI
2007
166views more  BMCBI 2007»
14 years 10 months ago
Data handling strategies for high throughput pyrosequencers
Background: New high throughput pyrosequencers such as the 454 Life Sciences GS 20 are capable of massively parallelizing DNA sequencing providing an unprecedented rate of output ...
Gabriele A. Trombetti, Raoul J. P. Bonnal, Ermanno...
JAR
2000
145views more  JAR 2000»
14 years 9 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
SIGIR
2004
ACM
15 years 3 months ago
Length normalization in XML retrieval
XML retrieval is a departure from standard document retrieval in which each individual XML element, ranging from italicized words or phrases to full blown articles, is a potential...
Jaap Kamps, Maarten de Rijke, Börkur Sigurbj&...