Sciweavers

13603 search results - page 317 / 2721
» On the Complexity of Computing Treelength
Sort
View
EDOC
2006
IEEE
16 years 8 days ago
Workshop on ODP for Enterprise Computing (WODPEC 2006)
The RM-ODP standard still provides the only comprehensive and coherent framework of concepts for the specification of complex large scale IT systems, and has taken on a new signif...
João Paulo A. Almeida, Peter F. Linington, ...
PCI
2005
Springer
15 years 11 months ago
Middleware for Building Ubiquitous Computing Applications Using Distributed Objects
Ubiquitous systems are characterized by multi-fold complexity, stemming mainly from the vast number of possible interactions between many heterogeneous objects and services. Device...
Nicolas Drossos, Eleni Christopoulou, Achilles Kam...
DBISP2P
2003
Springer
70views Database» more  DBISP2P 2003»
15 years 11 months ago
A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p sys...
Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenk...
ECAL
1995
Springer
15 years 9 months ago
A New Self-Reproducing Cellular Automaton Capable of Construction and Computation
We present a new self-reproducing cellular automaton capable of construction and computation beyond self-reproduction. Our automaton makes use of some of the concepts developed by...
Gianluca Tempesti
FOCS
1991
IEEE
15 years 9 months ago
Computing Sums of Radicals in Polynomial Time
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
Johannes Blömer