Sciweavers

601 search results - page 13 / 121
» Simulation vs. Equivalence
Sort
View
TACS
2001
Springer
14 years 2 months ago
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel sy...
Ph. Schnoebelen
ANSS
2008
IEEE
14 years 4 months ago
Beyond the Model of Persistent TCP Flows: Open-Loop vs Closed-Loop Arrivals of Non-persistent Flows
It is common for simulation and analytical studies to model Internet traffic as an aggregation of mostly persistent TCP flows. In practice, however, flows follow a heavytailed ...
Ravi S. Prasad, Constantine Dovrolis
CORR
2008
Springer
81views Education» more  CORR 2008»
13 years 9 months ago
Relay vs. User Cooperation in Time-Duplexed Multiaccess Networks
The performance of user-cooperation in a multi-access network is compared to that of using a wireless relay. Using the total transmit and processing power consumed at all nodes as...
Lalitha Sankar, Gerhard Kramer, Narayan B. Mandaya...
ASPLOS
1998
ACM
14 years 1 months ago
Fast Out-Of-Order Processor Simulation Using Memoization
Our new out-of-order processor simulator, FastSim, uses two innovations to speed up simulation 8–15 times (vs. Wisconsin SimpleScalar) with no loss in simulation accuracy. First...
Eric Schnarr, James R. Larus
LATIN
1995
Springer
14 years 1 months ago
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...
Jérôme Olivier Durand-Lose