Sciweavers

973 search results - page 75 / 195
» Arguing Using Opponent Models
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Reusing models in multi-agent simulation with software components
on models are abstract representations of systems one wants to study through computer simulation. In multiagent based simulation, such models usually represent agents and their re...
Paulo Salem da Silva, Ana Cristina Vieira de Melo
ENTCS
2011
131views more  ENTCS 2011»
13 years 2 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
13 years 2 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto
ANSS
2000
IEEE
14 years 4 days ago
IRLSim: A General Purpose Packet Level Network Simulator
Simulation is the main tool for studying networking protocols before deploying them in a wide scale, or for understanding how they are expected to behave under various conditions....
Andreas Terzis, Konstantinos Nikoloudakis, Lan Wan...
WSC
2007
13 years 10 months ago
Path-sampling for state-dependent importance sampling
State-dependent importance sampling (SDIS) has proved to be particularly useful in simulation (specially in rare event analysis of stochastic systems). One approach for designing ...
Jose H. Blanchet, Jingchen Liu