1662 search results - page 217 / 333 » The Computational Complexity of Agent Design Problems |
AAAI
2007
13 years 11 months ago
2007
Knowledge-based recommender technologies support customers and sales representatives in the identification of appropriate products and services. These technologies are especially ...
AAAI
1994
13 years 10 months ago
1994
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
MMAS
2011
Springer
13 years 3 months ago
2011
Springer
While existing mathematical descriptions can accurately account for phenomena at microscopic scales (e.g. molecular dynamics), these are often high-dimensional, stochastic and thei...
AAAI
1998
13 years 10 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
VLSID
2002
IEEE
14 years 9 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...