6167 search results - page 119 / 1234 » Can Refinement be Automated |
116
click to vote
ICCAD
2007
IEEE
16 years 1 months ago
2007
IEEE
Modern IC designs have reached unparalleled levels of complexity, resulting in more and more bugs discovered after design tape-out However, so far only very few EDA tools for post...
113
click to vote
ER
2007
Springer
15 years 10 months ago
2007
Springer
Although OWL provides a solid basis for many semantic-web applications, it lacks sufficient declarative semantics for instance recognition. This omission prevents OWL from being a ...
141
click to vote
ELPUB
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we report on our experience with the creation of an automated, human-assisted process to extract metadata from documents in a large (>100,000), dynamically growi...
189
click to vote
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
131
click to vote
ICDM
2003
IEEE
15 years 9 months ago
2003
IEEE
The data stream captured by recording inhabitantdevice interactions in an environment can be mined to discover significant patterns, which an intelligent agent could use to automa...