Sciweavers

2211 search results - page 156 / 443
» The state of peer-to-peer simulators and simulations
Sort
View
WSC
1998
14 years 11 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan
90
Voted
UAI
2000
14 years 11 months ago
Learning to Cooperate via Policy Search
Cooperative games are those in which both agents share the same payoff structure. Valuebased reinforcement-learning algorithms, such as variants of Q-learning, have been applied t...
Leonid Peshkin, Kee-Eung Kim, Nicolas Meuleau, Les...
GLOBECOM
2008
IEEE
14 years 11 months ago
Windowing BitTorrent for Video-on-Demand: Not All is Lost with Tit-for-Tat
—In this paper we present findings from our windowing BitTorrent simulations and show that by carefully optimizing other factors a reasonable level of performance can be achieved...
Petri Savolainen, Niklas Raatikainen, Sasu Tarkoma
ACTA
2006
108views more  ACTA 2006»
14 years 10 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
BMCBI
2007
155views more  BMCBI 2007»
14 years 10 months ago
Current approaches to gene regulatory network modelling
Many different approaches have been developed to model and simulate gene regulatory networks. We proposed the following categories for gene regulatory network models: network part...
Thomas Schlitt, Alvis Brazma