5606 search results - page 811 / 1122 » Randomization Techniques for Graphs. |
152
click to vote
ACSC
2006
IEEE
15 years 10 months ago
2006
IEEE
Communications devices intended for use in securitycritical applications must be rigorously evaluated to ensure they preserve data confidentiality. This process includes tracing t...
150
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
158
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
172
Voted
ILP
2000
Springer
15 years 10 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
175
click to vote
ICS
1995
Tsinghua U.
15 years 10 months ago
1995
Tsinghua U.
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...