1383 search results - page 138 / 277 » On the Complexity of the Interlace Polynomial |
226
click to vote
AAAI
2004
15 years 7 months ago
2004
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
149
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We apply the replica method to analyze vector precoding, a method to reduce transmit power in antenna array communications. The analysis applies to a very general class of channel...
197
click to vote
JAR
2007
15 years 6 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
292
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
149
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...