2796 search results - page 447 / 560 » The coolest path problem |
242
click to vote
VEE
2012
ACM
14 years 1 months ago
2012
ACM
Time Of Check To Time Of Use (TOCTTOU) race conditions for file accesses in user-space applications are a common problem in Unix-like systems. The mapping between filename and i...
123
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
137
click to vote
MICRO
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper evaluates several mechanisms for repairing the return-address stack after branch mispredictions. The return-address stack is a small but important structure for achievi...
188
click to vote
ITC
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper presents an efficient approach to generate tests for gate delay faults. Unlike other known algorithms which try to generate a 'good' delay test the presented ...
136
click to vote
DAC
2010
ACM
15 years 10 months ago
2010
ACM
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...