3758 search results - page 282 / 752 » A Complete Subsumption Algorithm |
175
click to vote
SEFM
2006
IEEE
16 years 18 days ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
172
click to vote
AAAI
2004
15 years 8 months ago
2004
CAT's knowledge base contains abstract task or example "abstract flight reservation task," which can be included in a workflow as placeholders. CAT will gest that us...
187
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The recent availability of complete sequences for numerous closely related bacterial genomes opens up new challenges in comparative genomics. Several methods have been...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
178
click to vote
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
Pre-bond testing of 3D stacked ICs involves testing individual dies before bonding. The overall yield of 3D ICs improves with prebond testability because designers can avoid stack...