1813 search results - page 172 / 363 » Instance Pruning Techniques |
152
click to vote
IWPC
2003
IEEE
15 years 11 months ago
2003
IEEE
Traditional approaches for program comprehension use static program analysis or dynamic program analysis in the form of execution traces. Our approach, however, makes use of runti...
164
click to vote
ICTCS
2001
Springer
15 years 11 months ago
2001
Springer
In [BCC00], we presented a general framework for extending calculi of mobile agents with object-oriented features, and we studied a typed instance of that model based on Cardelli a...
170
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
A novel methodology for circuit design and automatic layout generation is proposed for a class of mixed-signal circuits in presence of layout parasitics and substrate induced nois...
164
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
166
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. Hitherto existing approaches to label ranking implicitly operate...