Sciweavers

1355 search results - page 98 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
STOC
2009
ACM
107views Algorithms» more  STOC 2009»
14 years 9 months ago
Efficient discrete-time simulations of continuous-time quantum query algorithms
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
Richard Cleve, Daniel Gottesman, Michele Mosca, Ro...
CPHYSICS
2007
96views more  CPHYSICS 2007»
13 years 9 months ago
Simple models for biomembrane structure and dynamics
Simulation of biomembranes over length and time scales relevant to cellular biology is not currently feasible with molecular dynamics including full atomic detail. Barring an unfo...
Frank L. H. Brown
SPAA
1993
ACM
14 years 1 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
WSC
1997
13 years 10 months ago
Multiplexed State Saving for Bounded Rollback
Optimistic parallel discrete event simulation (PDES) uses a state history trail to support rollback. State saving strategies range from making a complete copy of a model’s state...
Fabian Gomes, Brian Unger, John G. Cleary, Steve F...
VLDB
2004
ACM
227views Database» more  VLDB 2004»
14 years 2 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...