Sciweavers

412 search results - page 33 / 83
» An evaluation of timed scenario notations
Sort
View
ACTAC
2007
69views more  ACTAC 2007»
13 years 11 months ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy
IPM
2006
75views more  IPM 2006»
13 years 11 months ago
Performance of query processing implementations in ranking-based text retrieval systems using inverted indices
Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11...
Berkant Barla Cambazoglu, Cevdet Aykanat
BMCBI
2010
118views more  BMCBI 2010»
13 years 11 months ago
Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests
Background: To understand the evolutionary role of Lateral Gene Transfer (LGT), accurate methods are needed to identify transferred genes and infer their timing of acquisition. Ph...
Sophie S. Abby, Eric Tannier, Manolo Gouy, Vincent...
MDM
2010
Springer
173views Communications» more  MDM 2010»
14 years 3 months ago
ParTAC: A Partition-Tolerant Atomic Commit Protocol for MANETs
—The support of distributed atomic transactions in mobile ad-hoc networks (MANET) is a key requirement for many mobile application scenarios. Atomicity is a fundamental property ...
Brahim Ayari, Abdelmajid Khelil, Neeraj Suri
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 11 months ago
About the Lifespan of Peer to Peer Networks
In this paper we analyze the ability of peer to peer networks to deliver a complete file among the peers. Early on we motivate a broad generalization of network behavior organizing...
Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, St&ea...