Sciweavers

3047 search results - page 334 / 610
» On the Meaning of Logical Completeness
Sort
View
IPPS
2006
IEEE
16 years 1 months ago
Using incentives to increase availability in a DHT
Distributed Hash Tables (DHTs) provide a means to build a completely decentralized, large-scale persistent storage service from the individual storage capacities contributed by ea...
Fabio Picconi, Pierre Sens
ICALP
2010
Springer
16 years 6 days ago
Compositionality in Graph Transformation
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Arend Rensink
SEKE
2009
Springer
15 years 12 months ago
Collaborative Development of System Architecture - a Tool for Coping with Inconsistency
Very large systems have an architecture that is designed to allow them to evolve through a long life. Such systems are developed by teams of architects. One of the first things t...
Peter Henderson, Matthew J. Henderson
AGENTS
2001
Springer
15 years 12 months ago
Terrain coverage with ant robots: a simulation study
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
Sven Koenig, Yaxin Liu
LICS
2000
IEEE
15 years 11 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki