Sciweavers

266 search results - page 13 / 54
» Can Saturation Be Parallelised
Sort
View
CPE
1998
Springer
80views Hardware» more  CPE 1998»
13 years 11 months ago
Probability, Parallelism and the State Space Exploration Problem
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
PARLE
1994
13 years 11 months ago
Modelling Photochemical Pollution using Parallel and Distributed Computing Platforms
Scientists are increasingly turning to numerical simulation in order to investigate and model complex environmental systems. Numerical simulation has enormous advantages over labor...
David Abramson, M. Cope, R. McKenzie
IJFIPM
2010
72views more  IJFIPM 2010»
13 years 4 months ago
Non-Rigid Registration for brain MRI: faster and cheaper
: We study the problem of Non-Rigid Registration (NRR) for intra-operative recovery of brain shift during image-guided neurosurgery. Time-critical nature of the tumour resection pr...
Yixun Liu, Andriy Fedorov, Ron Kikinis, Nikos Chri...
CDC
2008
IEEE
14 years 1 months ago
Wireless control of passive systems subject to actuator constraints
Abstract— Actuator constraints such as saturation can impose severe constraints on networked control systems. For instance delays in wireless control systems of unstable plants c...
Nicholas Kottenstette, Panos J. Antsaklis
INFOCOM
2003
IEEE
14 years 19 days ago
Kalman Filter Estimation of the Number of Competing Terminals in an IEEE 802.11 network
Abstract— Throughput performance of the IEEE 802.11 Distributed Coordination Function (DCF) is very sensitive to the number n of competing stations. The contribute of this paper ...
Giuseppe Bianchi, Ilenia Tinnirello