Relative Generic Computational Forensic Techniques

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3200, Issue , 2004, Pages 148-163

  Wong, Jennifer L ^a   Potkonjak, Miodrag ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; FORENSIC ENGINEERING; INTEGER PROGRAMMING; REVERSE ENGINEERING; SIMULATED ANNEALING;

CLASSIFICATION TECHNIQUE; COMPUTATIONAL FORENSICS; ENGINEERING TECHNIQUES; FORENSIC TECHNIQUES; GENERIC PROPERTIES; INTEGER LINEAR PROGRAMMING FORMULATION; INTEGER LINEAR PROGRAMS; PROBLEM INSTANCES; PROPERTY; PROPERTY RE-USE; BOOLEAN SATISFIABILITY; GRAPH COLORINGS;

SIMULATED ANNEALING; FORENSIC ENGINEERING;

EID: 35048900199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30114-1_11     Document Type: Article

References (13)

1. Qu, G., Potkonjak, M.: Intellectual Property Protection in VLSI Design: Theory and Practice. Kluwer (2003)
2. Breiman, L., et al.: Classification and Regression Trees. Chapman and Hall (1993)
3. Kirkpatrick, S., et al.: Optimization by simulated annealing. Science 220 (1983) 671-680
4. Wong, J., Kirovski, D., Potkonjak, M.: Non-parametrical statistical computational forensic techniques for intellectual property protection. In: 4th International Information Hiding Workshop. (2001) 71-86
5. Marques-Silva, J., Sakallah, K.: Boolean satisfiability in electronic design automation. In: Cliques, Coloring, and Satisfiability. (2000)
6. Hamzaoglu, I., Patel, J.: New techniques for deterministic test pattern generation. In: IEEE VLSI Test Symposium. (1998)
7. Zhang, H.: Sato: An efficient prepositional prover. In: Conference on Automated Deduction and LNAI 1249. (1997) 272-275
8. Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisability problems. In: AAAI. (1992) 440-446
9. Marques-Silva, J., Sakallah, K.: Grasp: a search algorithm for prepositional satisfiability. Transactions on Computers 48 (1999) 506-521
10. Selman, B., Kautz, H.: Domain-independent extensions to gsat: Solving large structured satisfiability problems. In: International Conference on Artificial Intelligence. (1993) 290-295
11. SATLIB: The satisfiability library, http://www.satlib.org (2004)
12. Brelaz, D.: New methods to color the vertices of a graph. Comm. of the ACM 22 (1979) 251-256
13. Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Journal of Computing 39 (1987) 345-351