The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase necessary assignments (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1990-2011 (10)
Publication types (Num. hits)
article(3) inproceedings(7)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10 occurrences of 10 keywords

Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
3Irith Pomeranz, Sudhakar M. Reddy Definition and application of approximate necessary assignments. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF necessary assignments, random test generation, test generation, stuck-at faults
1Irith Pomeranz, Sudhakar M. Reddy Input Necessary Assignments for Testing of Path Delay Faults in Standard-Scan Circuits. Search on Bibsonomy IEEE Trans. VLSI Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hiroshi Takahashi, Yoshinobu Higami, Toru Kikkawa, Takashi Aikyo, Yuzo Takamatsu, Hiroyuki Yotsuyanagi, Masaki Hashizume Test Generation and Diagnostic Test Generation for Open Faults with Considering Adjacent Lines. Search on Bibsonomy DFT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Vishnu C. Vimjam, Manan Syal, Michael S. Hsiao Untestable fault identification through enhanced necessary value assignments. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF implications, untestable faults
1Inês Lynce, João P. Marques Silva Improving SAT Algorithms by Using Search Pruning Techniques. Search on Bibsonomy CP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Maroun Kassab, Eduard Cerny, Sidi Aourid, Thomas H. Krodel Propagation of Last-Transition-Time Constraints in Gate-Level Timing Analysis. Search on Bibsonomy DATE The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Waveforms, Graph Dominators, Domain narrowing, Formal Verification, Timing Verification, Combinational Logic circuits
1Zohair Sahraoui, Francky Catthoor, Paul Six, Hugo De Man Techniques for Reducing the Number of Decisions and Backtracks in Combinational Test Generation. Search on Bibsonomy J. Electronic Testing The full citation details ... 1998 DBLP  DOI  BibTeX  RDF supergate, prime-and-irredundant, ATPG, BDD
1Vasco M. Manquinho, Paulo F. Flores, João P. Marques Silva, Arlindo L. Oliveira Prime Implicant Computation Using Satisfiability Algorithms. (PDF / PS) Search on Bibsonomy ICTAI The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Integer Programming Algorithms, Propositional Satisfiability Algorithms, Backtrack Search Strategies, Prime Implicants
1Wolfgang Kunz, Dhiraj K. Pradhan Recursive learning: a new implication technique for efficient solutions to CAD problems-test, verification, and optimization. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Janusz Rajski, Henry Cox A method to calculate necessary assignments in algorithmic test pattern generation. Search on Bibsonomy ITC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #10 of 10 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.