Sciweavers

19700 search results - page 179 / 3940
» DNA-Based Computation Times
Sort
View
ENTCS
2006
137views more  ENTCS 2006»
15 years 5 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
DSD
2007
IEEE
142views Hardware» more  DSD 2007»
15 years 11 months ago
Decoupling of Computation and Communication with a Communication Assist
Abstract. In an embedded multiprocessor system the minimum throughput and maximum latency of real-time applications are usually derived given the worst-case execution time of the s...
Arno Moonen, Marco Bekooij, Rene van den Berg, Jef...
ANTS
2004
Springer
233views Algorithms» more  ANTS 2004»
15 years 10 months ago
Computing Order Statistics in the Farey Sequence
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
Corina E. Patrascu, Mihai Patrascu
WADS
2009
Springer
267views Algorithms» more  WADS 2009»
15 years 9 months ago
Computing the Implicit Voronoi Diagram in Triple Precision
In a paper that considered arithmetic precision as a limited resource in the design and analysis of algorithms, Liotta, Preparata and Tamassia defined an “implicit Voronoi diagr...
David L. Millman, Jack Snoeyink
VLDB
1990
ACM
104views Database» more  VLDB 1990»
15 years 9 months ago
Hash-Based Join Algorithms for Multiprocessor Computers
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operatio...
Hongjun Lu, Kian-Lee Tan, Ming-Chien Shan