903 search results - page 169 / 181 » Completeness Results for Memory Logics |
154
click to vote
COCOON
2009
Springer
16 years 22 days ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
152
click to vote
ISCAS
2007
IEEE
16 years 13 days ago
2007
IEEE
—Discrete Cosine Transform (DCT) has been widely used in image/video coding systems, where zigzag scan is usually employed for DCT coefficient organization. However, due to local...
156
click to vote
CICLING
2007
Springer
16 years 10 days ago
2007
Springer
The present paper describes how dependency analysis can be used to automatically extract from a corpus a set of cases - and an accompanying vocabulary - which enable a template-bas...
173
click to vote
GECCO
2007
Springer
16 years 9 days ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
167
click to vote
DFT
2006
IEEE
16 years 6 days ago
2006
IEEE
Control flow checking (CFC) is a well known concurrent checking technique for ensuring that a program’s instruction execution sequence follows permissible paths. Almost all CFC...