3934 search results - page 302 / 787 » Approximate Schedulability Analysis |
175
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
187
click to vote
LOPSTR
2007
Springer
16 years 24 days ago
2007
Springer
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
216
click to vote
SIGMETRICS
1992
ACM
15 years 10 months ago
1992
ACM
The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approximate the performance of the Least Recently Used (LRU) replacement ...
182
click to vote
FUIN
2006
15 years 6 months ago
2006
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
181
click to vote
QEST
2009
IEEE
16 years 1 months ago
2009
IEEE
—Gossip protocols are designed to operate in very large, decentralised networks. A node in such a network bases its decision to interact (gossip) with another node on its partial...