1662 search results - page 294 / 333 » The Computational Complexity of Agent Design Problems |
113
click to vote
ICCSA
2007
Springer
14 years 11 months ago
2007
Springer
Natural language interfaces to databases are considered one of the best alternatives for final users who wish to make complex, uncommon and frequent queries, which is a very common...
LATIN
1998
Springer
15 years 1 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
101
click to vote
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
81
Voted
DAC
2008
ACM
15 years 10 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
BMCBI
2010
14 years 9 months ago
2010
Background: Human Immunodeficiency Virus type 1 (HIV-1), the causative agent of Acquired Immune Deficiency Syndrome (AIDS), exhibits very high genetic diversity with different var...