Sciweavers

181 search results - page 5 / 37
» Binary Change Set Composition
Sort
View
PODC
2004
ACM
14 years 1 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
VLSID
1996
IEEE
132views VLSI» more  VLSID 1996»
13 years 11 months ago
A study of composition schemes for mixed apply/compose based construction of ROBDDs
Reduced Ordered Binary Decision Diagrams ROBDDs have traditionally been built in a bottom-up fashion. In this scheme, the intermediate peak memory utilization is often larger than...
Amit Narayan, Sunil P. Khatri, Jawahar Jain, Masah...
PODC
1999
ACM
13 years 12 months ago
Dynamically Configurable Distributed Objects
The dynamically configurable distributed object (DCDO) model helps enable object evolution and facilitate the development of distributed objects from multiple independent implemen...
Michael J. Lewis, Andrew S. Grimshaw
ISSTA
2006
ACM
14 years 1 months ago
Towards an architectural approach for the dynamic and automatic composition of software components
In a component-based software system the components are specified, designed and implemented with the intention to be reused, and are assembled in various contexts in order to pro...
Antonio Bucchiarone, Andrea Polini, Patrizio Pelli...
IJFCS
2006
58views more  IJFCS 2006»
13 years 7 months ago
Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis
Transient simulation of a gate circuit is an efficient method of counting signal changes occurring during a transition of the circuit. It is known that this simulation covers the ...
Yuli Ye, Janusz A. Brzozowski