148 search results - page 3 / 30 » Formally Analyzing Expected Time Complexity of Algorithms Us... |
ICFEM
1997
Springer
13 years 10 months ago
1997
Springer
A real-time computer system is a system that must perform its functions within specified time bounds. These systems are generally characterized by complex interactions with the en...
ENTCS
2006
13 years 6 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
CIIA
2009
13 years 7 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
SPAA
1996
ACM
13 years 10 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
IWANN
2009
Springer
14 years 19 days ago
2009
Springer
Abstract. A new algorithm is presented for finding genotype-phenotype association rules from data related to complex diseases. The algorithm was based on Genetic Algorithms, a tech...