Sciweavers

608 search results - page 74 / 122
» Random Systems with Complete Connections
Sort
View
AGENTS
2001
Springer
15 years 2 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
INFOCOM
2007
IEEE
15 years 4 months ago
Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree
— The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several non-constant and constant degree interc...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
IPPS
2006
IEEE
15 years 3 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
DLOG
1996
14 years 11 months ago
Resolving Semantic Heterogeneity in Databases with a Terminological Model: Correspondence Refinement
The success of schema integration in multidatabase systems relies heavily on the determination of complete and refined correspondence relationships between them. So, the candidate...
Ounissa Larab, Aïcha-Nabila Benharkat
PE
2006
Springer
107views Optimization» more  PE 2006»
14 years 9 months ago
Efficient steady-state analysis of second-order fluid stochastic Petri nets
This paper presents an efficient solution technique for the steady-state analysis of the second-order Stochastic Fluid Model underlying a second-order Fluid Stochastic Petri Net (...
Marco Gribaudo, Rossano Gaeta