Sciweavers

3122 search results - page 30 / 625
» A Theory of Network Equivalence
Sort
View
AML
2010
99views more  AML 2010»
14 years 9 months ago
Effectively inseparable Boolean algebras in lattices of sentences
We show the non-arithmeticity of 1st order theories of lattices of n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithm...
V. Yu. Shavrukov
67
Voted
ANCS
2008
ACM
14 years 11 months ago
Efficient regular expression evaluation: theory to practice
Michela Becchi, Patrick Crowley
64
Voted
ASPDAC
2006
ACM
88views Hardware» more  ASPDAC 2006»
15 years 3 months ago
Equivalent circuit modeling of guard ring structures for evaluation of substrate crosstalk isolation
— A substrate-coupling equivalent circuit can be derived for an arbitrary guard ring test structure by way of F-matrix computation. The derived netlist represents a unified impe...
Daisuke Kosaka, Makoto Nagata
INFOSCALE
2006
ACM
15 years 3 months ago
Scheduling divisible loads in the dynamic heterogeneous grid environment
According to the special features of the dynamic heterogeneous grid environment, a loose-coupled and scalable resource model is described by a hybrid multi-level tree reflecting a...
Tao Zhu, Yongwei Wu, Guangwen Yang