Sciweavers

244 search results - page 4 / 49
» On the Tightness of the Buhrman-Cleve-Wigderson Simulation
Sort
View
IJON
2007
93views more  IJON 2007»
13 years 5 months ago
How much can we trust neural simulation strategies?
Despite a steady improvement of computational hardware, results of numerical simulation are still tightly bound to the simulation tool and strategy used, and may substantially var...
Michelle Rudolph, Alain Destexhe
WSC
2001
13 years 7 months ago
Simulating networks of wireless sensors
Recent advances in low-power embedded processors, radios, and micro-mechanical systems (MEMs) have made possible the development of networks of wirelessly interconnected sensors. ...
Sung Park, Andreas Savvides, Mani B. Srivastava
DATE
2008
IEEE
163views Hardware» more  DATE 2008»
13 years 7 months ago
A Simulation Methodology for Worst-Case Response Time Estimation of Distributed Real-Time Systems
In this paper, we propose a simulation-based methodology for worst-case response time estimation of distributed realtime systems. Schedulability analysis produces pessimistic uppe...
Soheil Samii, Sergiu Rafiliu, Petru Eles, Zebo Pen...
CORR
2004
Springer
114views Education» more  CORR 2004»
13 years 5 months ago
Quantum Communication Cannot Simulate a Public Coin
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
MEMOCODE
2003
IEEE
13 years 11 months ago
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
Tobias Schüle, Klaus Schneider