65 search results - page 5 / 13 » re 2000 |
68
Voted
AML
2010
14 years 10 months ago
2010
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...
77
Voted
HPCA
2003
IEEE
15 years 10 months ago
2003
IEEE
Inherent within complex instruction set architectures such as x86 are inefficiencies that do not exist in a simpler ISAs. Modern x86 implementations decode instructions into one o...
IFIP
2000
Springer
15 years 1 months ago
2000
Springer
Virtual enterprises have great difficulty in defining and adapting their business processes across the members of the virtual enterprise. We introduce an approach that allows (semi...
IFIPTCS
2000
15 years 1 months ago
2000
Abstract. We add name groups and group creation to the typed ambient calculus. Group creation is surprisingly interesting: it has the e ect of statically preventing certain communi...
103
Voted
IWSAS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Certain problems in which the environment is not well constrained do not lend themselves to a conventional open loop solution. Image understanding is such a problem domai...