Sciweavers

44 search results - page 8 / 9
» Analysis of Quorum-Based Protocols for Distributed (k 1)-Exc...
Sort
View
OPODIS
2003
13 years 9 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
MUM
2005
ACM
138views Multimedia» more  MUM 2005»
14 years 1 months ago
Group-based content push with dynamic session startup
This paper proposes an intelligent mobile middleware utilizing group-based content push with dynamic session startup and plugand-play features. Solution enhances the distribution ...
Otso Kassinen, Timo Koskela, Erkki Harjula, Jussi ...
BMCBI
2007
109views more  BMCBI 2007»
13 years 7 months ago
Seahawk: moving beyond HTML in Web-based bioinformatics analysis
Background: Traditional HTML interfaces for input to and output from Bioinformatics analysis on the Web are highly variable in style, content and data formats. Combining multiple ...
Paul M. K. Gordon, Christoph W. Sensen
MSWIM
2005
ACM
14 years 1 months ago
Using statistical design of experiments for analyzing mobile ad hoc networks
The performance of mobile ad hoc networks can be influenced by numerous factors, including protocol design at every layer; parameter settings such as retransmission limits and ti...
Michael W. Totaro, Dmitri D. Perkins