95 search results - page 6 / 19 » Finding one tight cycle |
IAT
2005
IEEE
14 years 3 months ago
2005
IEEE
Several problems are involved in the Virtual Enterprise (VE) formation process. One of the most important problems is the lack of understanding that may arise during agents’ int...
NCA
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, fundamental conditions which bound the network processing unit (NPU) worst-case performance are established. In particular, these conditions formalize and integrate...
DAM
2007
13 years 9 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
ITCC
2005
IEEE
14 years 3 months ago
2005
IEEE
1 Table lookups are one of the most frequently-used operations in symmetric-key ciphers. Particularly in the newer algorithms such as the Advanced Encryption Standard (AES), we fr...
DATE
2005
IEEE
14 years 3 months ago
2005
IEEE
As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space r...