567 search results - page 17 / 114 » Decomposing replicable functions |
USENIX
1990
13 years 8 months ago
1990
As we approach nation-wide integration of computer systems, it is clear that le replication will play a key role, both to improve data availability in the face of failures, and to...
SPAA
1997
ACM
13 years 11 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
HYBRID
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based ...
ISMVL
2010
IEEE
14 years 7 days ago
2010
IEEE
This paper proposes a new architecture for memorybased floating-point numeric function generators (NFGs). The design method uses piecewise-split edge-valued multivalued decision ...