3758 search results - page 405 / 752 » A Complete Subsumption Algorithm |
187
click to vote
INFORMATICALT
1998
15 years 6 months ago
1998
Principles of the framework called time series forecasting automation are presented. It is required in processing massive temporal data sets and creating completely user-oriented f...
170
click to vote
JCO
1998
15 years 6 months ago
1998
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
161
click to vote
TC
1998
15 years 6 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
148
click to vote
TELSYS
2002
15 years 6 months ago
2002
Abstract. In this paper, we present a receiver-oriented, request/response protocol for the Web that is compatible with the dynamics of TCP's congestion control algorithm. The ...
162
click to vote
TOG
2002
15 years 6 months ago
2002
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...