1552 search results - page 241 / 311 » On the Complexity of Constant Propagation |
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
104
click to vote
SIGMOD
1996
ACM
15 years 4 months ago
1996
ACM
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
105
click to vote
COMPGEOM
1993
ACM
15 years 4 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
162
click to vote
ICTL
1994
15 years 4 months ago
1994
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
105
click to vote
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...