14774 search results - page 191 / 2955 » Computational complexity and evolutionary computation |
180
click to vote
DBISP2P
2003
Springer
15 years 11 months ago
2003
Springer
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...
152
click to vote
ECAL
1995
Springer
15 years 10 months ago
1995
Springer
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...
200
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
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...
170
click to vote
AIPS
2004
15 years 7 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
138
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...