Sciweavers

181 search results - page 28 / 37
» Binary Change Set Composition
Sort
View
WOA
2003
13 years 8 months ago
An approach to the integration of peer-to-peer systems with active environments
— We adopt a form of group communication, called channeled multicast, for active rooms and other scenarios featuring strict real-time requirements, inherently unreliable communic...
Paolo Busetta, Mattia Merzi
BMCBI
2006
105views more  BMCBI 2006»
13 years 7 months ago
Integrative investigation of metabolic and transcriptomic data
Background: New analysis methods are being developed to integrate data from transcriptome, proteome, interactome, metabolome, and other investigative approaches. At the same time,...
Pinar Pir, Betül Kirdar, Andrew Hayes, Z. Ils...
JSS
2007
78views more  JSS 2007»
13 years 7 months ago
Understanding failure response in service discovery systems
Service discovery systems enable distributed components to find each other without prior arrangement, to express capabilities and needs, to aggregate into useful compositions, an...
Christopher Dabrowski, Kevin Mills, Stephen Quirol...
TON
2002
102views more  TON 2002»
13 years 7 months ago
A min, + system theory for constrained traffic regulation and dynamic service guarantees
By extending the system theory under the (min, +) algebra to the time-varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic ser...
Cheng-Shang Chang, Rene L. Cruz, Jean-Yves Le Boud...
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
13 years 11 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen